Combining Approximation Algorithms for the Prize-Collecting TSP
classification
💻 cs.DS
keywords
algorithmapproximationcombiningprize-collectingalgorithmsbienstockgoemansobtained
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.