Euclidean TSP in Narrow Strips

Alkema, Henk; de Berg, Mark; Kisfaludi-Bak, Sándor

doi:10.4230/LIPIcs.SoCG.2020.4

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Euclidean TSP in Narrow Strips

MPS-Authors

/persons/resource/persons252857

Kisfaludi-Bak, Sándor
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://drops.dagstuhl.de/opus/volltexte/2020/12162/
(Publisher version)

https://creativecommons.org/licenses/by/3.0/legalcode
(Copyright transfer agreement)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Alkema, H., de Berg, M., & Kisfaludi-Bak, S. (2020). Euclidean TSP in Narrow Strips. In S. Cabello, & D. Z. Chen (Eds.), 36th International Symposium on Computational Geometry (pp. 1-16). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.SoCG.2020.4.

Cite as: https://hdl.handle.net/21.11116/0000-0007-76E5-2

Abstract

There is no abstract available