A 4/3-approximation for TSP on cubic 3-edge-connected graphs

Details A 4/3-approximation for TSP on cubic 3-edge-connected graphs A 4/3-approximation for TSP on cubic 3-edge-connected graphs

2011-01-28

arxiv.org/abs/1101.5586v1

Computer Science

Data Structures and Algorithms

Scientific paper

We provide a polynomial time 4/3 approximation algorithm for TSP on metrics
arising from the metric completion of cubic 3-edge connected graphs.

Affiliated with

Also associated with

No associations

Rating

A 4/3-approximation for TSP on cubic 3-edge-connected graphs 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 4/3-approximation for TSP on cubic 3-edge-connected graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A 4/3-approximation for TSP on cubic 3-edge-connected graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-552636