theoretical computer science

Shorter Tours by Nicer Ears: 7/5-approximation for graphic TSP, 3/2 for the pathversion, and 4/3 for two-edge-connected subgraph

This content presents new approximation algorithms for fundamental graph problems, achieving improved performance. Specifically, it introduces a 7/5-approximation for graphic TSP, 3/2 for its path version, and 4/3 for the two-edge-connected subgraph problem.