A linear time approximation scheme for Euclidean TSP

DOI10.1109/FOCS.2013.80MaRDI QIDQ6981704zbMATH OpenFDO

Authors Yair Bartal, Lee-Ad Gottlieb

Publication date 20 May 2025

Full work available at URL https://doi.org/10.1109/FOCS.2013.80

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(5)

• A gap-ETH-tight approximation scheme for Euclidean TSP
• Improved approximation algorithm for individual fairness k-median
• Better guarantees for individual fairness k-median
• A (5/3+)-approximation for tricolored non-crossing Euclidean TSP
• Euclidean capacitated vehicle routing in the random setting: a 1.55-approximation algorithm

This page was built for publication: A linear time approximation scheme for Euclidean TSP

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