Euclidean TSP in Narrow Strips

We investigate how the complexity of Euclidean TSP for point sets P inside the strip ( - ∞ , + ∞ ) × [ 0 , δ ] depends on the strip width  δ . We obtain two main results. For the case where the points have distinct integer x -coordinates, we prove that a shortest bitonic tour (which can be computed...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete & computational geometry Ročník 71; číslo 4; s. 1456 - 1506
Hlavní autori:	Alkema, Henk, de Berg, Mark, van der Hofstad, Remco, Kisfaludi-Bak, Sándor
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.06.2024 Springer Nature B.V
Predmet:	Algorithms Combinatorics Computational Mathematics and Numerical Analysis Computer science Geometry Mathematics Mathematics and Statistics Strip Traveling salesman problem Bitonic TSP Computational geometry Euclidean TSP 68Q25 68W40 Fixed-parameter tractable algorithms
ISSN:	0179-5376, 1432-0444
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!