3 citations · 10 across the 13 of their papers we have counts for
17 papers
Cost Allocation for Set Covering: the Happy Nucleolus
Jannis Blauth, Antonia Ellerbrock, Vera Traub +1
We consider cost allocation for set covering problems. We allocate as much cost to the elements (players) as possible without violating the group rationality condition (no subset o…
Single-Source Unsplittable Flows in Planar Graphs
Vera Traub, Laura Vargas Koch, Rico Zenklusen
The single-source unsplittable flow (SSUF) problem asks to send flow from a common source to different terminals with unrelated demands, each terminal being served through a single…
A -Approximation Algorithm for Weighted Connectivity Augmentation
Vera Traub, Rico Zenklusen
Connectivity augmentation problems are among the most elementary questions in Network Design. Many of these problems admit natural -approximation algorithms, often through vario…
Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks
Jannis Blauth, Stephan Held, Dirk Müller +4
We develop theoretical foundations and practical algorithms for vehicle routing with time-dependent travel times. We also provide new benchmark instances and experimental results.…
Better-Than--Approximations for Leaf-to-Leaf Tree and Connectivity Augmentation
Federica Cecchetto, Vera Traub, Rico Zenklusen
The Connectivity Augmentation Problem (CAP) together with a well-known special case thereof known as the Tree Augmentation Problem (TAP) are among the most basic Network Design pro…
Breaching the 2-Approximation Barrier for the Forest Augmentation Problem
Fabrizio Grandoni, Afrouz Jabal Ameli, Vera Traub
The basic goal of survivable network design is to build cheap networks that guarantee the connectivity of certain pairs of nodes despite the failure of a few edges or nodes. A cele…