1 citations · 2 across the 8 of their papers we have counts for
11 papers
Unsplittable Cost Flows from Unweighted Error-Bounded Variants
Chaitanya Swamy, Vera Traub, Laura Vargas Koch +1
A famous conjecture of Goemans on single-source unsplittable flows states that one can turn any fractional flow into an unsplittable one of no higher cost, while increasing the loa…
Nash Flows Over Time with Tolls
Shaul Rosner, Marc Schröder, Laura Vargas Koch
We study a dynamic routing game motivated by traffic flows. The base model for an edge is the Vickrey bottleneck model. That is, edges are equipped with a free flow transit time an…
Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time
Neil Olver, Leon Sering, Laura Vargas Koch
We consider a dynamic model of traffic that has received a lot of attention in the past few years. Infinitesimally small agents aim to travel from a source to a destination as quic…
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 Simple Combinatorial Algorithm for Robust Matroid Center
Georg Anegg, Laura Vargas Koch, Rico Zenklusen
Recent progress on robust clustering led to constant-factor approximations for Robust Matroid Center. After a first combinatorial -approximation that is based on a matroid inter…
Techniques for Generalized Colorful -Center Problems
Georg Anegg, Laura Vargas Koch, Rico Zenklusen
Fair clustering enjoyed a surge of interest recently. One appealing way of integrating fairness aspects into classical clustering problems is by introducing multiple covering const…
Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time
Neil Olver, Leon Sering, Laura Vargas Koch
We consider a dynamic model of traffic that has received a lot of attention in the past few years. Users control infinitesimal flow particles aiming to travel from an origin to a d…
Convergence of a Packet Routing Model to Flows Over Time
Leon Sering, Laura Vargas Koch, Theresa Ziemke
The mathematical approaches for modeling dynamic traffic can roughly be divided into two categories: discrete packet routing models and continuous flow over time models. Despite ve…
A Greedy Algorithm for the Social Golfer and the Oberwolfach Problem
Daniel Schmand, Marc Schröder, Laura Vargas Koch
Inspired by the increasing popularity of Swiss-system tournaments in sports, we study the problem of predetermining the number of rounds that can be guaranteed in a Swiss-system to…
Nash Flows over Time with Spillback and Kinematic Waves
Leon Sering, Laura Vargas Koch
Modeling traffic in road networks is a widely studied but challenging problem, especially under the assumption that drivers act selfishly. A common approach is the deterministic qu…
Nash equilibria in routing games with edge priorities
Robert Scheffler, Martin Strehler, Laura Vargas Koch
In this paper we present a new competitive packet routing model with edge priorities. We consider players that route selfishly through a network over time and try to reach their de…