The following pages link to Vera Traub (Q2061852):
Displaying 21 items.
- A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering (Q2118143) (← links)
- An improved upper bound on the integrality ratio for the \(s\)-\(t\)-path TSP (Q2294304) (← links)
- Layers and matroids for the traveling salesman's paths (Q2417048) (← links)
- Improving on best-of-many-Christofides for \(T\)-tours (Q2661569) (← links)
- Approaching $\frac{3}{2}$ for the $s$-$t$-path TSP (Q4608010) (← links)
- A Fast $$(2 + 2/7)$$-Approximation Algorithm for Capacitated Cycle Covering (Q5041760) (← links)
- An improved approximation algorithm for ATSP (Q5144891) (← links)
- Reducing path TSP to TSP (Q5144892) (← links)
- Approaching 3/2 for the <i>s</i> - <i>t</i> -path TSP (Q5244387) (← links)
- Reducing Path TSP to TSP (Q5860476) (← links)
- An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem (Q5863328) (← links)
- Improving the approximation ratio for capacitated vehicle routing (Q5918417) (← links)
- The asymmetric traveling salesman path LP has constant integrality ratio (Q5918918) (← links)
- Improving the approximation ratio for capacitated vehicle routing (Q5925635) (← links)
- Beating the Integrality Ratio for $s$-$t$-Tours in Graphs (Q6139824) (← links)
- Cost Allocation for Set Covering: the Happy Nucleolus (Q6516600) (← links)
- Local search for weighted tree augmentation and Steiner tree (Q6575209) (← links)
- Approximation algorithms for traveling salesman problems (Q6593134) (← links)
- Vehicle routing with time-dependent travel times: theory, practice, and benchmarks (Q6602334) (← links)
- Better-than-\(\frac{4}{3}\)-approximations for leaf-to-leaf tree and connectivity augmentation (Q6608041) (← links)
- Single-source unsplittable flows in planar graphs (Q6645369) (← links)
