activity
20122026
most citedAn Approximation Algorithm for Fully Planar Edge-Disjoint Paths

6 citations · 19 across the 16 of their papers we have counts for

collaborators
Showing 2012Show all

1 paper · 1 filter

cs.DM2012

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

András Sebő, Jens Vygen

We prove new results for approximating the graphic TSP and some related problems. We obtain polynomial-time algorithms with improved approximation guarantees. For the graphic TSP i…