The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus

Details The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus

2009-09-15

arxiv.org/abs/0909.2849v4

Computer Science

Data Structures and Algorithms

Scientific paper

We give a constant factor approximation algorithm for the asymmetric
traveling salesman problem when the support graph of the solution of the
Held-Karp linear programming relaxation has bounded orientable genus.

Affiliated with

Also associated with

No associations

Rating

The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus 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 The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-556307