English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

The Travelling Salesman Problem is one the most fundamental and most studiedproblems in approximation algorithms. For more than 30 years, the bestalgorithm known for general metrics has been Christofides's algorithm withapproximation factor of 3/2, even though the so-called Held-Karp LP relaxationof the problem is conjectured to have the integrality gap of only 4/3. Veryrecently, significant progress has been made for the important special case ofgraphic metrics, first by Oveis Gharan et al., and then by Momke and Svensson.In this paper, we provide an improved analysis for the approach introduced byMomke and Svensson yielding a bound of 13/9 on the approximation factor, aswell as a bound of 19/12+epsilon for any epsilon>0 for a more generalTravelling Salesman Path Problem in graphic metrics.

13/9-approximation for Graphic TSP