The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus
Shayan Oveis Gharan, Amin Saberi
TL;DR
This paper presents a constant factor approximation algorithm for the asymmetric traveling salesman problem on graphs with bounded genus, expanding the class of graphs where efficient solutions are achievable.
Contribution
It introduces a novel approximation algorithm applicable to graphs with bounded orientable genus, a significant extension over previous methods.
Findings
Achieves a constant factor approximation for the problem.
Applicable to graphs with bounded orientable genus.
Extends the scope of efficient algorithms for TSP.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsVehicle Routing Optimization Methods · Scheduling and Timetabling Solutions · Advanced Graph Theory Research