Vera Traub

From MaRDI portal
Person:2061852

Available identifiers

zbMath Open traub.veraMaRDI QIDQ2061852

List of research outcomes





PublicationDate of PublicationType
Single-source unsplittable flows in planar graphs2024-11-28Paper
Better-than-\(\frac{4}{3}\)-approximations for leaf-to-leaf tree and connectivity augmentation2024-09-19Paper
Vehicle routing with time-dependent travel times: theory, practice, and benchmarks2024-09-11Paper
Approximation algorithms for traveling salesman problems2024-08-26Paper
Local search for weighted tree augmentation and Steiner tree2024-07-19Paper
A \((1.5+\varepsilon)\)-approximation algorithm for weighted connectivity augmentation2024-05-08Paper
Beating the Integrality Ratio for $s$-$t$-Tours in Graphs2023-12-19Paper
Breaching the 2-approximation barrier for the forest augmentation problem2023-12-08Paper
Bridging the gap between tree and connectivity augmentation: unified and stronger approaches2023-11-14Paper
Improving the approximation ratio for capacitated vehicle routing2023-03-14Paper
A Fast $$(2 + 2/7)$$-Approximation Algorithm for Capacitated Cycle Covering2022-10-14Paper
A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering2022-03-22Paper
An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem2022-03-11Paper
Improving the approximation ratio for capacitated vehicle routing2021-12-21Paper
Reducing Path TSP to TSP2021-11-19Paper
Improving on best-of-many-Christofides for \(T\)-tours2021-04-07Paper
An improved approximation algorithm for ATSP2021-01-19Paper
Reducing path TSP to TSP2021-01-19Paper
The asymmetric traveling salesman path LP has constant integrality ratio2020-08-28Paper
An improved upper bound on the integrality ratio for the \(s\)-\(t\)-path TSP2020-02-10Paper
The asymmetric traveling salesman path LP has constant integrality ratio2020-02-06Paper
Approaching 3/2 for the s - t -path TSP2019-11-21Paper
Layers and matroids for the traveling salesman's paths2019-06-11Paper
Approaching $\frac{3}{2}$ for the $s$-$t$-path TSP2018-03-15Paper
Layers and Matroids for the Traveling Salesman's Paths2017-03-21Paper
Cost Allocation for Set Covering: the Happy NucleolusN/APaper

Research outcomes over time

This page was built for person: Vera Traub