Vera Traub

activity

20182022

most citedA

(1.5 + ε)

-Approximation Algorithm for Weighted Connectivity Augmentation

2 citations · 2 across the 4 of their papers we have counts for

collaborators

Showing cs.DMShow all

4 papers · 1 filter

cs.DM2020

Improving on Best-of-Many-Christofides for $T$ -tours

Vera Traub

The $T$ -tour problem is a natural generalization of TSP and Path TSP. Given a graph $G = (V, E)$ , edge cost $c : E \to R_{\geq 0}$ , and an even cardinality set $T \subseteq V$ ,…

cs.DM2019

Reducing Path TSP to TSP

Vera Traub, Jens Vygen, Rico Zenklusen

We present a black-box reduction from the path version of the Traveling Salesman Problem (Path TSP) to the classical tour version (TSP). More precisely, we show that given an $α$ -a…

cs.DM2018

The asymmetric traveling salesman path LP has constant integrality ratio

Anna Köhne, Vera Traub, Jens Vygen

We show that the classical LP relaxation of the asymmetric traveling salesman path problem (ATSPP) has constant integrality ratio. If $ρ_{ATSP}$ and $ρ_{ATSPP}$ denot…

cs.DM2018

An improved upper bound on the integrality ratio for the $s$ - $t$ -path TSP

Vera Traub, Jens Vygen

We give an improved analysis of the best-of-many Christofides algorithm with lonely edge deletion, which was proposed by Sebő and van Zuylen [2016]. This implies an improved upper…

Improving on Best-of-Many-Christofides for T-tours

Reducing Path TSP to TSP

The asymmetric traveling salesman path LP has constant integrality ratio

An improved upper bound on the integrality ratio for the s-t-path TSP

Improving on Best-of-Many-Christofides for $T$ -tours

An improved upper bound on the integrality ratio for the $s$ - $t$ -path TSP