Shorter tours by nicer ears: 7/5-Approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

open at publisher browse 1 citing papers

representative citing papers

cs.DS · 2026-06-16 · unverdicted · novelty 6.0

Obtains a tight competitive ratio for the online Connectivity Augmentation Problem, improving prior bounds.

Showing 1 of 1 citing paper.

Online Connectivity Augmentation cs.DS · 2026-06-16 · unverdicted · none · ref 42
Obtains a tight competitive ratio for the online Connectivity Augmentation Problem, improving prior bounds.