Vera Traub

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 47

Top Topics

Timing Constraints

Vehicle Routing

Top Venues

Oper. Res. Lett.

Publications

Jaroslaw Byrka, Fabrizio Grandoni, Vera Traub
The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller than 2. CoRR (2024)
Vera Traub, Laura Vargas Koch, Rico Zenklusen
Single-Source Unsplittable Flows in Planar Graphs. SODA (2024)
Jannis Blauth, Antonia Ellerbrock, Vera Traub, Jens Vygen
Cost Allocation for Set Covering: the Happy Nucleolus. CoRR (2024)
Federica Cecchetto, Vera Traub, Rico Zenklusen
Better-than-$\frac{4}{3}$-approximations for leaf-to-leaf tree and connectivity augmentation. Math. Program. 207 (1) (2024)
Jannis Blauth, Stephan Held, Dirk Müller, Niklas Schlomberg, Vera Traub, Thorben Tröbst, Jens Vygen
Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks. Discret. Optim. 53 (2024)
Vera Traub, Jens Vygen
Beating the Integrality Ratio for $s$-$t$-Tours in Graphs. SIAM J. Comput. 52 (6) (2023)
Vera Traub, Laura Vargas Koch, Rico Zenklusen
Single-Source Unsplittable Flows in Planar Graphs. CoRR (2023)
Vera Traub, Rico Zenklusen
A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation. STOC (2023)
Jannis Blauth, Vera Traub, Jens Vygen
Improving the approximation ratio for capacitated vehicle routing. Math. Program. 197 (2) (2023)
Vera Traub, Rico Zenklusen
A Better-Than-2 Approximation for Weighted Tree Augmentation. FOCS (2022)
Vera Traub, Rico Zenklusen
A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation. CoRR (2022)
Vera Traub, Jens Vygen
An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem. SIAM J. Comput. 51 (1) (2022)
Vera Traub, Jens Vygen, Rico Zenklusen
Reducing Path TSP to TSP. SIAM J. Comput. 51 (3) (2022)
Vera Traub, Thorben Tröbst
A fast $(2 + \frac{2}{7})$-approximation algorithm for capacitated cycle covering. Math. Program. 192 (1) (2022)
Vera Traub, Rico Zenklusen
Local Search for Weighted Tree Augmentation and Steiner Tree. SODA (2022)
Jannis Blauth, Stephan Held, Dirk Müller, Niklas Schlomberg, Vera Traub, Thorben Tröbst, Jens Vygen
Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks. CoRR (2022)
Federica Cecchetto, Vera Traub, Rico Zenklusen
Better-Than-4/3-Approximations for Leaf-to-Leaf Tree and Connectivity Augmentation. CoRR (2022)
Fabrizio Grandoni, Afrouz Jabal Ameli, Vera Traub
Breaching the 2-approximation barrier for the forest augmentation problem. STOC (2022)
Jannis Blauth, Vera Traub, Jens Vygen
Improving the Approximation Ratio for Capacitated Vehicle Routing. IPCO (2021)
Federica Cecchetto, Vera Traub, Rico Zenklusen
Bridging the gap between tree and connectivity augmentation: unified and stronger approaches. STOC (2021)
Vera Traub, Rico Zenklusen
A Better-Than-2 Approximation for Weighted Tree Augmentation. FOCS (2021)
Vera Traub, Rico Zenklusen
A Better-Than-2 Approximation for Weighted Tree Augmentation. CoRR (2021)
Fabrizio Grandoni, Afrouz Jabal Ameli, Vera Traub
Breaching the 2-Approximation Barrier for the Forest Augmentation Problem. CoRR (2021)
Vera Traub, Rico Zenklusen
Local Search for Weighted Tree Augmentation and Steiner Tree. CoRR (2021)
Jannis Blauth, Vera Traub, Jens Vygen
Improving the Approximation Ratio for Capacitated Vehicle Routing. CoRR (2020)
Vera Traub
Improving on Best-of-Many-Christofides for T-tours. CoRR (2020)
Vera Traub, Thorben Tröbst
A Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle Covering. IPCO (2020)
Vera Traub
Improving on Best-of-Many-Christofides for T-tours. Oper. Res. Lett. 48 (6) (2020)
Federica Cecchetto, Vera Traub, Rico Zenklusen
Bridging the Gap Between Tree and Connectivity Augmentation: Unified and Stronger Approaches. CoRR (2020)
Vera Traub, Jens Vygen, Rico Zenklusen
Reducing path TSP to TSP. STOC (2020)
Anna Köhne, Vera Traub, Jens Vygen
The asymmetric traveling salesman path LP has constant integrality ratio. Math. Program. 183 (1) (2020)
Vera Traub, Jens Vygen
An improved approximation algorithm for ATSP. STOC (2020)
Vera Traub, Jens Vygen
-path TSP. J. ACM 66 (2) (2019)
Vera Traub, Jens Vygen
An improved upper bound on the integrality ratio for the s-t-path TSP. Oper. Res. Lett. 47 (3) (2019)
Vera Traub, Jens Vygen
An improved approximation algorithm for ATSP. CoRR (2019)
Vera Traub, Jens Vygen, Rico Zenklusen
Reducing Path TSP to TSP. CoRR (2019)
Anna Köhne, Vera Traub, Jens Vygen
The Asymmetric Traveling Salesman Path LP Has Constant Integrality Ratio. IPCO (2019)
Vera Traub, Jens Vygen
Beating the Integrality Ratio for s-t-Tours in Graphs. FOCS (2018)
Vera Traub, Jens Vygen
Beating the integrality ratio for s-t-tours in graphs. CoRR (2018)
Vera Traub, Jens Vygen
-path TSP. SODA (2018)
Stephan Held, Dirk Müller, Daniel Rotter, Rudolf Scheifele, Vera Traub, Jens Vygen
Global Routing With Timing Constraints. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 37 (2) (2018)
Vera Traub, Jens Vygen
An improved upper bound on the integrality ratio for the s-t-path TSP. CoRR (2018)
Frans Schalekamp, András Sebö, Vera Traub, Anke van Zuylen
Layers and matroids for the traveling salesman's paths. Oper. Res. Lett. 46 (1) (2018)
Anna Köhne, Vera Traub, Jens Vygen
The asymmetric traveling salesman path LP has constant integrality ratio. CoRR (2018)
Vera Traub, Jens Vygen
Approaching $\frac{3}{2}$ for the $s$-$t$-path TSP. CoRR (2017)
Frans Schalekamp, András Sebö, Vera Traub, Anke van Zuylen
Layers and Matroids for the Traveling Salesman's Paths. CoRR (2017)
Stephan Held, Dirk Müller, Daniel Rotter, Vera Traub, Jens Vygen
Global Routing with Inherent Static Timing Constraints. ICCAD (2015)