TY - GEN
T1 - TSP in a Simple Polygon.
AU - Alkema, Henk
AU - Berg, Mark de
AU - Monemizadeh, Morteza
AU - Theocharous, Leonidas
N1 - DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.
PY - 2022/9/1
Y1 - 2022/9/1
N2 - We study the Traveling Salesman Problem inside a simple polygon. In this problem, which we call tsp in a simple polygon, we wish to compute a shortest tour that visits a given set S of n sites inside a simple polygon P with m edges while staying inside the polygon. This natural problem has, to the best of our knowledge, not been studied so far from a theoretical perspective. It can be solved exactly in poly(n,m) + 2O(√ n log n) time, using an algorithm by Marx, Pilipczuk, and Pilipczuk (FOCS 2018) for subset tsp as a subroutine. We present a much simpler algorithm that solves tsp in a simple polygon directly and that has the same running time.
AB - We study the Traveling Salesman Problem inside a simple polygon. In this problem, which we call tsp in a simple polygon, we wish to compute a shortest tour that visits a given set S of n sites inside a simple polygon P with m edges while staying inside the polygon. This natural problem has, to the best of our knowledge, not been studied so far from a theoretical perspective. It can be solved exactly in poly(n,m) + 2O(√ n log n) time, using an algorithm by Marx, Pilipczuk, and Pilipczuk (FOCS 2018) for subset tsp as a subroutine. We present a much simpler algorithm that solves tsp in a simple polygon directly and that has the same running time.
KW - Subexponential algorithms
KW - TSP with obstacles
KW - Traveling Salesman Problem
UR - http://www.scopus.com/inward/record.url?scp=85137590581&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.ESA.2022.5
DO - 10.4230/LIPIcs.ESA.2022.5
M3 - Conference contribution
SP - 5:1-5:14
BT - 30th Annual European Symposium on Algorithms, ESA 2022
A2 - Chechik, Shiri
A2 - Navarro, Gonzalo
A2 - Rotenberg, Eva
A2 - Herman, Grzegorz
ER -