23 citations · 38 across the 14 of their papers we have counts for
17 papers
Fast Combinatorial Algorithms for Efficient Sortation
Madison Van Dyk, Kim Klause, Jochen Koenemann +1
Modern parcel logistic networks are designed to ship demand between given origin, destination pairs of nodes in an underlying directed network. Efficiency dictates that volume need…
Travelling on Graphs with Small Highway Dimension
Yann Disser, Andreas Emil Feldmann, Max Klimm +1
We study the Travelling Salesperson (TSP) and the Steiner Tree problem (STP) in graphs of low highway dimension. This graph parameter was introduced by Abraham et al. [SODA 2010] a…
Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time
Jochen Koenemann, Kanstantsin Pashkovich, Justin Toth
We provide an efficient algorithm for computing the nucleolus for an instance of a weighted cooperative matching game. This resolves a long-standing open question posed in [Faigle,…
Vehicle Routing with Subtours
Stephan Held, Jochen Könemann, Jens Vygen
When delivering items to a set of destinations, one can save time and cost by passing a subset to a sub-contractor at any point en route. We consider a model where a set of items a…
On the Integrality Gap of the Prize-Collecting Steiner Forest LP
Jochen Könemann, Neil Olver, Kanstantsin Pashkovich +3
In the prize-collecting Steiner forest (PCSF) problem, we are given an undirected graph , edge costs , terminal pairs , and…
A -Approximation Algorithm for Tree Augmentation via Chvátal-Gomory Cuts
Samuel Fiorini, Martin Groß, Jochen Könemann +1
The weighted tree augmentation problem (WTAP) is a fundamental network design problem. We are given an undirected tree , an additional set of edges called links and…