Combining Approximation Algorithms for the Prize-Collecting TSP

Details Combining Approximation Algorithms for the Prize-Collecting TSP Combining Approximation Algorithms for the Prize-Collecting TSP

2009-10-03

arxiv.org/abs/0910.0553v1

Computer Science

Data Structures and Algorithms

5 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Combining Approximation Algorithms for the Prize-Collecting TSP does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Combining Approximation Algorithms for the Prize-Collecting TSP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combining Approximation Algorithms for the Prize-Collecting TSP will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-432445