On the Approximability of the Traveling Salesman Problem with Line Neighborhoods

Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussaConference contributionScientificvertaisarvioitu

9 Lataukset (Pure)


We study the variant of the Euclidean Traveling Salesman problem where instead of a set of points, we are given a set of lines as input, and the goal is to find the shortest tour that visits each line. The best known upper and lower bounds for the problem in Rd, with d ≥ 3, are NP-hardness and an O(log3 n)-approximation algorithm which is based on a reduction to the group Steiner tree problem. We show that TSP with lines in Rd is APX-hard for any d ≥ 3. More generally, this implies that TSP with k-dimensional flats does not admit a PTAS for any 1 ≤ k ≤ d - 2 unless P = NP, which gives a complete classification regarding the existence of polynomial time approximation schemes for these problems, as there are known PTASes for k = 0 (i.e., points) and k = d - 1 (hyperplanes). We are able to give a stronger inapproximability factor for d = O(log n) by showing that TSP with lines does not admit a (2 - ϵ)-approximation in d dimensions under the Unique Games Conjecture. On the positive side, we leverage recent results on restricted variants of the group Steiner tree problem in order to give an O(log2 n)-approximation algorithm for the problem, albeit with a running time of nO(log log n).

Otsikko18th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2022
ToimittajatArtur Czumaj, Qin Xin
KustantajaSchloss Dagstuhl-Leibniz-Zentrum für Informatik
ISBN (elektroninen)978-3-95977-236-5
DOI - pysyväislinkit
TilaJulkaistu - 1 kesäk. 2022
OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisuussa
TapahtumaScandinavian Symposium and Workshops on Algorithm Theory - Torshavn, Färsaaret
Kesto: 27 kesäk. 202229 kesäk. 2022
Konferenssinumero: 18


NimiLeibniz International Proceedings in Informatics, LIPIcs
KustantajaSchloss Dagstuhl
ISSN (elektroninen)1868-8969


ConferenceScandinavian Symposium and Workshops on Algorithm Theory


Sukella tutkimusaiheisiin 'On the Approximability of the Traveling Salesman Problem with Line Neighborhoods'. Ne muodostavat yhdessä ainutlaatuisen sormenjäljen.

Siteeraa tätä