In the Tricolored Euclidean Traveling Salesperson problem, we are given k = 3 sets of points in the plane and are looking for disjoint tours, each covering one of the sets. Arora (1998) famously gave a PTAS based on "patching" for the case k = 1 and, recently, Dross et al. (2023) generalized this result to k = 2. Our contribution is a (5/3+ε)-approximation algorithm for k = 3 that further generalizes Arora’s approach. It is believed that patching is generally no longer possible for more than two tours. We circumvent this issue by either applying a conditional patching scheme for three tours or using an alternative approach based on a weighted solution for k = 2.
@InProceedings{baligacs_et_al:LIPIcs.ESA.2024.15, author = {Balig\'{a}cs, J\'{u}lia and Disser, Yann and Feldmann, Andreas Emil and Zych-Pawlewicz, Anna}, title = {{A (5/3+\epsilon)-Approximation for Tricolored Non-Crossing Euclidean TSP}}, booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)}, pages = {15:1--15:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-338-6}, ISSN = {1868-8969}, year = {2024}, volume = {308}, editor = {Chan, Timothy and Fischer, Johannes and Iacono, John and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.15}, URN = {urn:nbn:de:0030-drops-210862}, doi = {10.4230/LIPIcs.ESA.2024.15}, annote = {Keywords: Approximation Algorithms, geometric Network Optimization, Euclidean TSP, non-crossing Structures} }
Feedback for Dagstuhl Publishing