Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVera Traub
Person information
- affiliation: University of Bonn, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Vera Traub, Laura Vargas Koch, Rico Zenklusen:
Single-Source Unsplittable Flows in Planar Graphs. SODA 2024: 639-668- [i18]Jannis Blauth, Antonia Ellerbrock, Vera Traub, Jens Vygen:
Cost Allocation for Set Covering: the Happy Nucleolus. CoRR abs/2401.04040 (2024) - 2023
- [j11]Jannis Blauth
, Vera Traub, Jens Vygen:
Improving the approximation ratio for capacitated vehicle routing. Math. Program. 197(2): 451-497 (2023) - [j10]Vera Traub, Jens Vygen:
Beating the Integrality Ratio for $s$-$t$-Tours in Graphs. SIAM J. Comput. 52(6): S18-37 (2023) - [c13]Vera Traub, Rico Zenklusen:
A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation. STOC 2023: 1820-1833 - [i17]Vera Traub, Laura Vargas Koch, Rico Zenklusen:
Single-Source Unsplittable Flows in Planar Graphs. CoRR abs/2308.02651 (2023) - 2022
- [j9]Vera Traub, Thorben Tröbst:
A fast $(2 + \frac{2}{7})$-approximation algorithm for capacitated cycle covering. Math. Program. 192(1): 497-518 (2022) - [j8]Vera Traub, Jens Vygen:
An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem. SIAM J. Comput. 51(1): 139-173 (2022) - [j7]Vera Traub, Jens Vygen, Rico Zenklusen:
Reducing Path TSP to TSP. SIAM J. Comput. 51(3): 20-24 (2022) - [c12]Vera Traub, Rico Zenklusen:
Local Search for Weighted Tree Augmentation and Steiner Tree. SODA 2022: 3253-3272 - [c11]Fabrizio Grandoni, Afrouz Jabal Ameli, Vera Traub:
Breaching the 2-approximation barrier for the forest augmentation problem. STOC 2022: 1598-1611 - [i16]Federica Cecchetto, Vera Traub, Rico Zenklusen:
Better-Than-4/3-Approximations for Leaf-to-Leaf Tree and Connectivity Augmentation. CoRR abs/2204.06944 (2022) - [i15]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 abs/2205.00889 (2022) - [i14]Vera Traub, Rico Zenklusen:
A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation. CoRR abs/2209.07860 (2022) - 2021
- [c10]Vera Traub, Rico Zenklusen:
A Better-Than-2 Approximation for Weighted Tree Augmentation. FOCS 2021: 1-12 - [c9]Jannis Blauth, Vera Traub, Jens Vygen:
Improving the Approximation Ratio for Capacitated Vehicle Routing. IPCO 2021: 1-14 - [c8]Federica Cecchetto, Vera Traub, Rico Zenklusen:
Bridging the gap between tree and connectivity augmentation: unified and stronger approaches. STOC 2021: 370-383 - [i13]Vera Traub, Rico Zenklusen:
A Better-Than-2 Approximation for Weighted Tree Augmentation. CoRR abs/2104.07114 (2021) - [i12]Vera Traub, Rico Zenklusen:
Local Search for Weighted Tree Augmentation and Steiner Tree. CoRR abs/2107.07403 (2021) - [i11]Fabrizio Grandoni, Afrouz Jabal Ameli, Vera Traub:
Breaching the 2-Approximation Barrier for the Forest Augmentation Problem. CoRR abs/2112.11799 (2021) - 2020
- [b1]Vera Traub:
Approximation Algorithms for Traveling Salesman Problems. University of Bonn, Germany, 2020 - [j6]Anna Köhne, Vera Traub, Jens Vygen:
The asymmetric traveling salesman path LP has constant integrality ratio. Math. Program. 183(1): 379-395 (2020) - [j5]Vera Traub:
Improving on Best-of-Many-Christofides for T-tours. Oper. Res. Lett. 48(6): 798-804 (2020) - [c7]Vera Traub, Thorben Tröbst:
A Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle Covering. IPCO 2020: 391-404 - [c6]Vera Traub, Jens Vygen:
An improved approximation algorithm for ATSP. STOC 2020: 1-13 - [c5]Vera Traub, Jens Vygen, Rico Zenklusen:
Reducing path TSP to TSP. STOC 2020: 14-27 - [i10]Vera Traub:
Improving on Best-of-Many-Christofides for T-tours. CoRR abs/2009.09743 (2020) - [i9]Jannis Blauth, Vera Traub, Jens Vygen:
Improving the Approximation Ratio for Capacitated Vehicle Routing. CoRR abs/2011.05235 (2020) - [i8]Federica Cecchetto, Vera Traub, Rico Zenklusen:
Bridging the Gap Between Tree and Connectivity Augmentation: Unified and Stronger Approaches. CoRR abs/2012.00086 (2020)
2010 – 2019
- 2019
- [j4]Vera Traub, Jens Vygen:
Approaching 3/2 for the s-t-path TSP. J. ACM 66(2): 14:1-14:17 (2019) - [j3]Vera Traub, Jens Vygen:
An improved upper bound on the integrality ratio for the s-t-path TSP. Oper. Res. Lett. 47(3): 225-228 (2019) - [c4]Anna Köhne, Vera Traub, Jens Vygen:
The Asymmetric Traveling Salesman Path LP Has Constant Integrality Ratio. IPCO 2019: 288-298 - [i7]Vera Traub, Jens Vygen, Rico Zenklusen:
Reducing Path TSP to TSP. CoRR abs/1907.10376 (2019) - [i6]Vera Traub, Jens Vygen:
An improved approximation algorithm for ATSP. CoRR abs/1912.00670 (2019) - 2018
- [j2]Frans Schalekamp, András Sebö, Vera Traub, Anke van Zuylen:
Layers and matroids for the traveling salesman's paths. Oper. Res. Lett. 46(1): 60-63 (2018) - [j1]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): 406-419 (2018) - [c3]Vera Traub, Jens Vygen:
Beating the Integrality Ratio for s-t-Tours in Graphs. FOCS 2018: 766-777 - [c2]Vera Traub, Jens Vygen:
Approaching for the s-t-path TSP. SODA 2018: 1854-1864 - [i5]Vera Traub, Jens Vygen:
Beating the integrality ratio for s-t-tours in graphs. CoRR abs/1804.03112 (2018) - [i4]Anna Köhne, Vera Traub, Jens Vygen:
The asymmetric traveling salesman path LP has constant integrality ratio. CoRR abs/1808.06542 (2018) - [i3]Vera Traub, Jens Vygen:
An improved upper bound on the integrality ratio for the s-t-path TSP. CoRR abs/1808.10734 (2018) - 2017
- [i2]Frans Schalekamp, András Sebö, Vera Traub, Anke van Zuylen:
Layers and Matroids for the Traveling Salesman's Paths. CoRR abs/1703.07170 (2017) - [i1]Vera Traub, Jens Vygen:
Approaching $\frac{3}{2}$ for the $s$-$t$-path TSP. CoRR abs/1707.03992 (2017) - 2015
- [c1]Stephan Held, Dirk Müller, Daniel Rotter, Vera Traub, Jens Vygen:
Global Routing with Inherent Static Timing Constraints. ICCAD 2015: 102-109
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-03 20:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
