#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2015

2016

- This year (0)
- Last 5 years (3)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Jaroslaw Byrka, Bartosz Rybicki, Sumedha Uniyal
- ArXiv
- 2015

- Fabrizio Grandoni, Salvatore Ingala, Sumedha Uniyal
- WAOA
- 2015

In the well-studied Unsplittable Flow on a Path problem (UFP), we are given a path graph with edge capacities. Furthermore, we are given a collection of n tasks, each one characterized by a subpath, a weight, and a demand. Our goal is to select a maximum weight subset of tasks so that the total demand of selected tasks using each edge is upper bounded by… (More)

- Jaroslaw Byrka, Bartosz Rybicki, Sumedha Uniyal
- IPCO
- 2016

We study the Capacitated k-Median problem, for which all the known constant factor approximation algorithms violate either the number of facilities or the capacities. While the standard LP-relaxation can only be used for algorithms violating one of the two by a factor of at least two, Shi Li [SODA'15, SODA'16] gave algorithms violating the number of… (More)

- ‹
- 1
- ›