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 2022Show all

3 papers · 1 filter

cs.DS2022★ 2 cited

A $(1.5 + ε)$ -Approximation Algorithm for Weighted Connectivity Augmentation

Vera Traub, Rico Zenklusen

Connectivity augmentation problems are among the most elementary questions in Network Design. Many of these problems admit natural $2$ -approximation algorithms, often through vario…

cs.DS2022★ 2 cited

Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks

Jannis Blauth, Stephan Held, Dirk Müller +4

We develop theoretical foundations and practical algorithms for vehicle routing with time-dependent travel times. We also provide new benchmark instances and experimental results.…

cs.DS2022

Better-Than- $\frac{4}{3}$ -Approximations for Leaf-to-Leaf Tree and Connectivity Augmentation

Federica Cecchetto, Vera Traub, Rico Zenklusen

The Connectivity Augmentation Problem (CAP) together with a well-known special case thereof known as the Tree Augmentation Problem (TAP) are among the most basic Network Design pro…

A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation

Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks

Better-Than-34​-Approximations for Leaf-to-Leaf Tree and Connectivity Augmentation

A $(1.5 + ε)$ -Approximation Algorithm for Weighted Connectivity Augmentation

Better-Than- $\frac{4}{3}$ -Approximations for Leaf-to-Leaf Tree and Connectivity Augmentation