Vera Traub

activity

20172024

\frac{3}{2}

for the

s

t

-path TSP

3 citations · 10 across the 13 of their papers we have counts for

collaborators

Showing 2017 · cs.DMShow all

2 papers · 2 filters

cs.DM2017★ 3 cited

Approaching $\frac{3}{2}$ for the $s$ - $t$ -path TSP

Vera Traub, Jens Vygen

We show that there is a polynomial-time algorithm with approximation guarantee $\frac{3}{2} + ε$ for the $s$ - $t$ -path TSP, for any fixed $ε > 0$ . It is well known that Wolsey's analysi…

cs.DM2017

Layers and Matroids for the Traveling Salesman's Paths

Frans Schalekamp, András Sebő, Vera Traub +1

Gottschalk and Vygen proved that every solution of the subtour elimination linear program for traveling salesman paths is a convex combination of more and more restrictive "general…

Approaching 23​ for the s-t-path TSP

Layers and Matroids for the Traveling Salesman's Paths

Approaching $\frac{3}{2}$ for the $s$ - $t$ -path TSP