English

Combining Approximation Algorithms for the Prize-Collecting TSP

Data Structures and Algorithms 2009-10-06 v1
Authors: Michel X. Goemans
View on arXiv ↗ PDF ↗

Abstract

We present a 1.91457-approximation algorithm for the prize-collecting travelling salesman problem. This is obtained by combining a randomized variant of a rounding algorithm of Bienstock et al. and a primal-dual algorithm of Goemans and Williamson.

Keywords

traveling salesman problem

Cite

@article{arxiv.0910.0553,
  title  = {Combining Approximation Algorithms for the Prize-Collecting TSP},
  author = {Michel X. Goemans},
  journal= {arXiv preprint arXiv:0910.0553},
  year   = {2009}
}

Comments

5 pages

Related papers

View all related →
Data Structures and Algorithms · Computer Science
Approximating Prize-Collecting Variants of TSP
Morteza Alimi, Tobias Mömke, Michael Ruderer
2024-11-25
Data Structures and Algorithms · Computer Science
A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem
Michel X. Goemans, Nicholas J. A. Harvey, Kamal Jain, Mohit Singh
2009-09-07
Data Structures and Algorithms · Computer Science
A Better-Than-1.6-Approximation for Prize-Collecting TSP
Jannis Blauth, Nathan Klein, Martin Nägele
2025-01-14
Data Structures and Algorithms · Computer Science
An improved approximation guarantee for Prize-Collecting TSP
Jannis Blauth, Martin Nägele
2023-04-13
Data Structures and Algorithms · Computer Science
On Approximating Multi-Criteria TSP
Bodo Manthey
2011-07-14
Computational Complexity · Computer Science
The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme
Yair Bartal, Lee-Ad Gottlieb, Robert Krauthgamer
2016-09-09
Discrete Mathematics · Computer Science
An improved approximation algorithm for ATSP
Vera Traub, Jens Vygen
2021-06-09
Computer Science and Game Theory · Computer Science
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
Katarzyna Paluch, Marcin Mucha, Aleksander Madry
2015-05-13
Artificial Intelligence · Computer Science
An Empirical Analysis of Approximation Algorithms for the Euclidean Traveling Salesman Problem
Yihui He, Ming Xiang
2017-05-26
Data Structures and Algorithms · Computer Science
Approximation algorithms for the prize-collecting rural postman problem
Hong Li, Jianping Li, Wei Li, Runtao Xie +1
2026-05-26
Combinatorics · Mathematics
Comparison of approximation algorithms for the travelling salesperson problem on semimetric graphs
Mateusz Krukowski, Filip Turoboś
2021-09-03
Data Structures and Algorithms · Computer Science
Better Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring
Katarzyna Paluch
2014-01-16
Discrete Mathematics · Computer Science
Reassembling trees for the traveling salesman
Jens Vygen
2016-01-06
Quantum Physics · Physics
Towards Efficiently Solving Quantum Traveling Salesman Problem
Debabrata Goswami, Harish Karnick, Prateek Jain, Hemanta K. Maji
2007-05-23
Data Structures and Algorithms · Computer Science
On the Recoverable Traveling Salesman Problem
Marc Goerigk, Stefan Lendl, Lasse Wulf
2021-11-19
Data Structures and Algorithms · Computer Science
A $4/5$ - Approximation Algorithm for the Maximum Traveling Salesman Problem
Szymon Dudycz, Jan Marcinkowski, Katarzyna Paluch, Bartosz Rybicki
2016-03-22
Data Structures and Algorithms · Computer Science
A Heuristic Algorithm Based on Tour Rebuilding Operator for the Traveling Salesman Problem
Yang Li, Junbin Gao, Mingyuan Bai, Chengjun Li +1
2019-11-12
Data Structures and Algorithms · Computer Science
Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems
Greg N. Frederickson, Barry Wittman
2009-05-28
Distributed, Parallel, and Cluster Computing · Computer Science
A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem
Rabab Alkhalifa, Fatima Alkhomayes, Boushra Almazroua, Dana Alhaidan +2
2025-05-27
Data Structures and Algorithms · Computer Science
A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem
Paulo Feofiloff, Cristina G. Fernandes, Carlos E. Ferreira, Jose Coelho de Pina
2010-06-21
Combinatorics · Mathematics
The Floyd-Warshall Algorithm, the AP and the TSP, Part II
Howard Kleiman
2007-05-23
Data Structures and Algorithms · Computer Science
LP-Based Approximation Algorithms for Traveling Salesman Path Problems
Hyung-Chan An, David B. Shmoys
2011-10-31
Data Structures and Algorithms · Computer Science
New Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring
Katarzyna Paluch
2020-12-23
Data Structures and Algorithms · Computer Science
Learning-Augmented Algorithms for Online TSP on the Line
Themis Gouleakis, Konstantinos Lakis, Golnoosh Shahkarami
2022-06-02
Data Structures and Algorithms · Computer Science
A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem
Yuki Amano, Kazuhisa Makino
2020-12-29
R2 v1 2026-06-21T13:53:44.896Z