Approximation algorithms for the Euclidean bipartite TSP

Authors:
Andreas Baltz;Anand Srivastav
Affiliations:
Mathematisches Seminar, CAU Kiel, Christian-Albrechts-Platz 4, D-24098 Kiel, Germany;Mathematisches Seminar, CAU Kiel, Christian-Albrechts-Platz 4, D-24098 Kiel, Germany
Venue:
Operations Research Letters
Year:
2005

Citing 4
Cited 0

Integer and combinatorial optimization

Integer and combinatorial optimization
Approximating geometrical graphs via “spanners” and “banyans”

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Polynomial time approximation schemes for Euclidean TSP and other geometric problems

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study approximation results for the Euclidean bipartite traveling salesman problem (TSP). We present the first worst-case examples, proving that the approximation guarantees of two known polynomial-time algorithms are tight. Moreover, we propose a new algorithm which displays a superior average case behavior indicated by computational experiments.