On the approximability of the traveling salesman problem with line neighborhoods

DOI10.4230/LIPICS.SWAT.2022.10MaRDI QIDQ6544069zbMATH OpenFDO

Authors Antonios Foivos Antoniadis, Sándor Kisfaludi-Bak, B. Laekhanukit, Daniel Vaz

Publication date 27 May 2024

Full work available at URL https://doi.org/10.4230/LIPICS.SWAT.2022.10

zbMATH Keywords

geometric approximation algorithmsgroup Steiner treetraveling salesman with neighborhoods

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• A PTAS for TSP with neighbourhoods over parallel line segments

This page was built for publication: On the approximability of the traveling salesman problem with line neighborhoods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6544069)