42 citations · 204 across the 38 of their papers we have counts for
5 papers · 1 filter
Dynamic Facility Location via Exponential Clocks
Hyung-Chan An, Ashkan Norouzi-Fard, Ola Svensson
The \emph{dynamic facility location problem} is a generalization of the classic facility location problem proposed by Eisenstat, Mathieu, and Schabanel to model the dynamics of evo…
Combinatorial Algorithm for Restricted Max-Min Fair Allocation
Chidambaram Annamalai, Christos Kalaitzis, Ola Svensson
We study the basic allocation problem of assigning resources to players so as to maximize fairness. This is one of the few natural problems that enjoys the intriguing status of hav…
LP-Based Algorithms for Capacitated Facility Location
Hyung-Chan An, Mohit Singh, Ola Svensson
Linear programming has played a key role in the study of algorithms for combinatorial optimization problems. In the field of approximation algorithms, this is well illustrated by t…
A Simple -Competitive Algorithm for the Matroid Secretary Problem
Moran Feldman, Ola Svensson, Rico Zenklusen
Only recently progress has been made in obtaining -competitive algorithms for the matroid secretary problem. More precisely, Chakraborty and Lachish (2012)…
On the Configuration LP for Maximum Budgeted Allocation
Christos Kalaitzis, Aleksander Mcadry, Alantha Newman +2
We study the Maximum Budgeted Allocation problem, i.e., the problem of selling a set of indivisible goods to players, each with a separate budget, such that we maximize the…