A Proof of the Boyd-Carr Conjecture

Details A Proof of the Boyd-Carr Conjecture A Proof of the Boyd-Carr Conjecture

2011-07-08

arxiv.org/abs/1107.1628v1

Computer Science

Data Structures and Algorithms

Scientific paper

Determining the precise integrality gap for the subtour LP relaxation of the traveling salesman problem is a significant open question, with little progress made in thirty years in the general case of symmetric costs that obey triangle inequality. Boyd and Carr [3] observe that we do not even know the worst-case upper bound on the ratio of the optimal 2-matching to the subtour LP; they conjecture the ratio is at most 10/9. In this paper, we prove the Boyd-Carr conjecture. In the case that a fractional 2-matching has no cut edge, we can further prove that an optimal 2-matching is at most 10/9 times the cost of the fractional 2-matching.

Affiliated with

Also associated with

No associations

Rating

A Proof of the Boyd-Carr Conjecture 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 A Proof of the Boyd-Carr Conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Proof of the Boyd-Carr Conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-222327