Vera Traub

According to our database, Vera Traub authored at least 26 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Cost Allocation for Set Covering: the Happy Nucleolus.

Jannis Blauth, Antonia Ellerbrock, Vera Traub, Jens Vygen

CoRR, 2024

Single-Source Unsplittable Flows in Planar Graphs.

Vera Traub, Laura Vargas Koch, Rico Zenklusen

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Beating the Integrality Ratio for $s$-$t$-Tours in Graphs.

Vera Traub, Jens Vygen

SIAM J. Comput., December, 2023

Improving the approximation ratio for capacitated vehicle routing.

Jannis Blauth, Vera Traub, Jens Vygen

Math. Program., February, 2023

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

Vera Traub, Rico Zenklusen

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022

Reducing Path TSP to TSP.

Vera Traub, Jens Vygen, Rico Zenklusen

SIAM J. Comput., June, 2022

An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem.

Vera Traub, Jens Vygen

SIAM J. Comput., 2022

A fast $(2 + \frac{2}{7})$-approximation algorithm for capacitated cycle covering.

Vera Traub, Thorben Tröbst

Math. Program., 2022

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

Jannis Blauth, Stephan Held, Dirk Müller, Niklas Schlomberg, Vera Traub, Thorben Tröbst, Jens Vygen

CoRR, 2022

Better-Than-4/3-Approximations for Leaf-to-Leaf Tree and Connectivity Augmentation.

Federica Cecchetto, Vera Traub, Rico Zenklusen

CoRR, 2022

Breaching the 2-approximation barrier for the forest augmentation problem.

Fabrizio Grandoni, Afrouz Jabal Ameli, Vera Traub

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Local Search for Weighted Tree Augmentation and Steiner Tree.

Vera Traub, Rico Zenklusen

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

Bridging the gap between tree and connectivity augmentation: unified and stronger approaches.

Federica Cecchetto, Vera Traub, Rico Zenklusen

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

A Better-Than-2 Approximation for Weighted Tree Augmentation.

Vera Traub, Rico Zenklusen

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Approximation Algorithms for Traveling Salesman Problems

Vera Traub

PhD thesis, 2020

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

Vera Traub

Oper. Res. Lett., 2020

The asymmetric traveling salesman path LP has constant integrality ratio.

Anna Köhne, Vera Traub, Jens Vygen

Math. Program., 2020

An improved approximation algorithm for ATSP.

Vera Traub, Jens Vygen

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

A Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle Covering.

Vera Traub, Thorben Tröbst

Proceedings of the Integer Programming and Combinatorial Optimization, 2020

2019

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

Vera Traub, Jens Vygen

Oper. Res. Lett., 2019

Approaching 3/2 for the <i>s</i>-<i>t</i>-path TSP.

Vera Traub, Jens Vygen

J. ACM, 2019

2018

Global Routing With Timing Constraints.

Stephan Held, Dirk Müller, Daniel Rotter, Rudolf Scheifele, Vera Traub, Jens Vygen

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2018

Layers and matroids for the traveling salesman's paths.

Frans Schalekamp, András Sebö, Vera Traub, Anke van Zuylen

Oper. Res. Lett., 2018

Approaching for the <i>s</i>-<i>t</i>-path TSP.

Vera Traub, Jens Vygen

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

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

Vera Traub, Jens Vygen

CoRR, 2017

2015

Global Routing with Inherent Static Timing Constraints.

Stephan Held, Dirk Müller, Daniel Rotter, Vera Traub, Jens Vygen

Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, 2015