Vera Traub - RankMe

59 papers A* 12A 1B 4Journal 40Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Approximating Asymmetric A Priori TSP beyond the Adaptivity Gap. SODA Manuel Christalla, Luise Puhlmann, Vera Traub
2026	J	`jnl`	The Bidirected Cut Relaxation for Steiner Tree: Better Integrality Gap Bounds and the Limits of Moat Growing. CoRR Paul Paschmanns, Vera Traub
2026	—	`conf`	Unsplittable Cost Flows from Unweighted Error-Bounded Variants. SOSA Chaitanya Swamy, Vera Traub, Laura Vargas Koch, Rico Zenklusen
2025	J	`jnl`	Approximating Asymmetric A Priori TSP beyond the Adaptivity Gap. CoRR Manuel Christalla, Luise Puhlmann, Vera Traub
2025	J	`jnl`	Approximation Schemes for Planar Graph Connectivity Problems. CoRR Meike Neuwohner, Vera Traub, Rico Zenklusen
2025	J	`jnl`	Better-Than-2 Approximations for Weighted Tree Augmentation and Applications to Steiner Tree. J. ACM Vera Traub, Rico Zenklusen
2025	B	`conf`	On the Bidirected Cut Relaxation for Steiner Forest. IPCO Jaroslaw Byrka, Fabrizio Grandoni, Vera Traub
2025	J	`jnl`	Steiner Forest: A Simplified Better-Than-2 Approximation. CoRR Anupam Gupta, Vera Traub
2025	J	`jnl`	Unsplittable Cost Flows from Unweighted Error-Bounded Variants. CoRR Chaitanya Swamy, Vera Traub, Laura Vargas Koch, Rico Zenklusen
2024	J	`jnl`	Better-than-$\frac{4}{3}$-approximations for leaf-to-leaf tree and connectivity augmentation. Math. Program. Federica Cecchetto, Vera Traub, Rico Zenklusen
2024	J	`jnl`	Cost Allocation for Set Covering: the Happy Nucleolus. CoRR Jannis Blauth, Antonia Ellerbrock, Vera Traub, Jens Vygen
2024	J	`jnl`	Cost allocation for set covering: The happy nucleolus. Oper. Res. Lett. Jannis Blauth, Antonia Ellerbrock, Vera Traub, Jens Vygen
2024	J	`jnl`	On the Bidirected Cut Relaxation for Steiner Forest. CoRR Jaroslaw Byrka, Fabrizio Grandoni, Vera Traub
2024	A*	`conf`	Single-Source Unsplittable Flows in Planar Graphs. SODA Vera Traub, Laura Vargas Koch, Rico Zenklusen
2024	A*	`conf`	The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller Than 2. FOCS Jaroslaw Byrka, Fabrizio Grandoni, Vera Traub
2024	J	`jnl`	The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller than 2. CoRR Jaroslaw Byrka, Fabrizio Grandoni, Vera Traub
2024	J	`jnl`	Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks. Discret. Optim. Jannis Blauth, Stephan Held, Dirk Müller, Niklas Schlomberg, Vera Traub, Thorben Tröbst, Jens Vygen
2023	A*	`conf`	A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation. STOC Vera Traub, Rico Zenklusen
2023	J	`jnl`	Beating the Integrality Ratio for $s$-$t$-Tours in Graphs. SIAM J. Comput. Vera Traub, Jens Vygen
2023	J	`jnl`	Improving the approximation ratio for capacitated vehicle routing. Math. Program. Jannis Blauth, Vera Traub, Jens Vygen
2023	J	`jnl`	Single-Source Unsplittable Flows in Planar Graphs. CoRR Vera Traub, Laura Vargas Koch, Rico Zenklusen
2022	J	`jnl`	A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation. CoRR Vera Traub, Rico Zenklusen
2022	J	`jnl`	A fast $(2 + \frac{2}{7})$-approximation algorithm for capacitated cycle covering. Math. Program. Vera Traub, Thorben Tröbst
2022	J	`jnl`	An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem. SIAM J. Comput. Vera Traub, Jens Vygen
2022	J	`jnl`	Better-Than-4/3-Approximations for Leaf-to-Leaf Tree and Connectivity Augmentation. CoRR Federica Cecchetto, Vera Traub, Rico Zenklusen
2022	A*	`conf`	Breaching the 2-approximation barrier for the forest augmentation problem. STOC Fabrizio Grandoni, Afrouz Jabal Ameli, Vera Traub
2022	A*	`conf`	Local Search for Weighted Tree Augmentation and Steiner Tree. SODA Vera Traub, Rico Zenklusen
2022	J	`jnl`	Reducing Path TSP to TSP. SIAM J. Comput. Vera Traub, Jens Vygen, Rico Zenklusen
2022	J	`jnl`	Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks. CoRR Jannis Blauth, Stephan Held, Dirk Müller, Niklas Schlomberg, Vera Traub, Thorben Tröbst, Jens Vygen
2021	A*	`conf`	A Better-Than-2 Approximation for Weighted Tree Augmentation. FOCS Vera Traub, Rico Zenklusen
2021	J	`jnl`	A Better-Than-2 Approximation for Weighted Tree Augmentation. CoRR Vera Traub, Rico Zenklusen
2021	J	`jnl`	Breaching the 2-Approximation Barrier for the Forest Augmentation Problem. CoRR Fabrizio Grandoni, Afrouz Jabal Ameli, Vera Traub
2021	A*	`conf`	Bridging the gap between tree and connectivity augmentation: unified and stronger approaches. STOC Federica Cecchetto, Vera Traub, Rico Zenklusen
2021	B	`conf`	Improving the Approximation Ratio for Capacitated Vehicle Routing. IPCO Jannis Blauth, Vera Traub, Jens Vygen
2021	J	`jnl`	Local Search for Weighted Tree Augmentation and Steiner Tree. CoRR Vera Traub, Rico Zenklusen
2020	B	`conf`	A Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle Covering. IPCO Vera Traub, Thorben Tröbst
2020	A*	`conf`	An improved approximation algorithm for ATSP. STOC Vera Traub, Jens Vygen
2020	—	`—`	Approximation Algorithms for Traveling Salesman Problems Vera Traub
2020	J	`jnl`	Bridging the Gap Between Tree and Connectivity Augmentation: Unified and Stronger Approaches. CoRR Federica Cecchetto, Vera Traub, Rico Zenklusen
2020	J	`jnl`	Improving on Best-of-Many-Christofides for T-tours. CoRR Vera Traub
2020	J	`jnl`	Improving on Best-of-Many-Christofides for T-tours. Oper. Res. Lett. Vera Traub
2020	J	`jnl`	Improving the Approximation Ratio for Capacitated Vehicle Routing. CoRR Jannis Blauth, Vera Traub, Jens Vygen
2020	A*	`conf`	Reducing path TSP to TSP. STOC Vera Traub, Jens Vygen, Rico Zenklusen
2020	J	`jnl`	The asymmetric traveling salesman path LP has constant integrality ratio. Math. Program. Anna Köhne, Vera Traub, Jens Vygen
2019	J	`jnl`	An improved approximation algorithm for ATSP. CoRR Vera Traub, Jens Vygen
2019	J	`jnl`	An improved upper bound on the integrality ratio for the s-t-path TSP. Oper. Res. Lett. Vera Traub, Jens Vygen
2019	J	`jnl`	Approaching 3/2 for the J. ACM Vera Traub, Jens Vygen
2019	J	`jnl`	Reducing Path TSP to TSP. CoRR Vera Traub, Jens Vygen, Rico Zenklusen
2019	B	`conf`	The Asymmetric Traveling Salesman Path LP Has Constant Integrality Ratio. IPCO Anna Köhne, Vera Traub, Jens Vygen
2018	J	`jnl`	An improved upper bound on the integrality ratio for the s-t-path TSP. CoRR Vera Traub, Jens Vygen
2018	A*	`conf`	Approaching for the SODA Vera Traub, Jens Vygen
2018	A*	`conf`	Beating the Integrality Ratio for s-t-Tours in Graphs. FOCS Vera Traub, Jens Vygen
2018	J	`jnl`	Beating the integrality ratio for s-t-tours in graphs. CoRR Vera Traub, Jens Vygen
2018	J	`jnl`	Global Routing With Timing Constraints. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Stephan Held, Dirk Müller, Daniel Rotter, Rudolf Scheifele, Vera Traub, Jens Vygen
2018	J	`jnl`	Layers and matroids for the traveling salesman's paths. Oper. Res. Lett. Frans Schalekamp, András Sebö, Vera Traub, Anke van Zuylen
2018	J	`jnl`	The asymmetric traveling salesman path LP has constant integrality ratio. CoRR Anna Köhne, Vera Traub, Jens Vygen
2017	J	`jnl`	Approaching $\frac{3}{2}$ for the $s$-$t$-path TSP. CoRR Vera Traub, Jens Vygen
2017	J	`jnl`	Layers and Matroids for the Traveling Salesman's Paths. CoRR Frans Schalekamp, András Sebö, Vera Traub, Anke van Zuylen
2015	A	`conf`	Global Routing with Inherent Static Timing Constraints. ICCAD Stephan Held, Dirk Müller, Daniel Rotter, Vera Traub, Jens Vygen