Watchman Route Problem
CHF 37.15
Auf Lager
SKU
8L6PECNCOMF
1 Verfügbar 
Kostenloser Versand ab CHF 50
Geliefert zwischen Do., 30.10.2025 und Fr., 31.10.2025
Details
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The Watchman Problem is an optimization problem in computational geometry where the objective is to compute the shortest route a watchman should take to guard an entire area with obstacles given only a map of the area. The challenge is to make sure the watchman peeks behind every corner and to determine the best order in which corners should be visited in. There are polynomial-time solutions but they all suffer from severe numerical problems inherent in the computations.Note that this is not the same as the museum problem, which is about a similar situation, but with multiple, stationary watchmen.
30 Tage Rückgaberecht
GarantieWeitere Informationen
- Allgemeine Informationen
- GTIN 09786137950555
- Editor Adélaïde Laurie Felicie
- Sprache Englisch
- Auflage Aufl.
- Größe H220mm x B220mm
- Jahr 2011
- EAN 9786137950555
- Format Kartonierter Einband (Kt)
- ISBN 978-613-7-95055-5
- Titel Watchman Route Problem
- Untertitel Computational Geometry, Mathematical Optimization, Time Complexity
- Herausgeber SALV
- Anzahl Seiten 68
- Genre Informatik
Bewertungen
Schreiben Sie eine Bewertung
