Reproduce “Approximating graphic TSP by b-matchings” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Swati Gupta, Mehrdad Sohrabi, Levent Tunçel
The authors present StarMatch, a polynomial-time algorithm for graphic traveling salesperson tours, using removable stars and an odd-join formulation to balance parity correction, savings, and connectivity-restoration costs. The subtour-LP value—the minimum fractional edge weight meeting every proper cut at least twice—is a lower bound on tour length. StarMatch guarantees at most 89/64 times that value for connected simple graphs; an example’s 27-versus-28 tours are not the general guarantee.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.