research
∙
08/04/2023
Single-Source Unsplittable Flows in Planar Graphs
The single-source unsplittable flow (SSUF) problem asks to send flow fro...
share
research
∙
04/27/2023
A flow-based ascending auction to compute buyer-optimal Walrasian prices
We consider a market where a set of objects is sold to a set of buyers, ...
research
∙
11/07/2022
A Simple Combinatorial Algorithm for Robust Matroid Center
Recent progress on robust clustering led to constant-factor approximatio...
research
∙
07/06/2022
Techniques for Generalized Colorful k-Center Problems
Fair clustering enjoyed a surge of interest recently. One appealing way ...
research
∙
11/12/2021
Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time
We consider a dynamic model of traffic that has received a lot of attent...
research
∙
05/27/2021
Convergence of a Packet Routing Model to Flows Over Time
The mathematical approaches for modeling dynamic traffic can roughly be ...
research
∙
07/21/2020
A Greedy Algorithm for the Social Golfer and the Oberwolfach Problem
Inspired by the increasing popularity of Swiss-system tournaments in spo...
research
∙
07/16/2018
Nash Flows over Time with Spillback
Modeling traffic in road networks is a widely studied but challenging pr...
research
∙
03/02/2018