15 citations · 22 across the 3 of their papers we have counts for
3 papers
cs.DS2014★ 15 cited
An Improved Approximation Algorithm for the Hard Uniform Capacitated k-median Problem
Shanfei Li
In the -median problem, given a set of locations, the goal is to select a subset of at most centers so as to minimize the total cost of connecting each location to its neare…
cs.DS2013★ 7 cited
Approximation Algorithms for Hard Capacitated -facility Location Problems
Karen Aardal, Pieter van den Berg, Dion Gijswijt +1
We study the capacitated -facility location problem, in which we are given a set of clients with demands, a set of facilities with capacities and a constant number . It costs…
cs.DS2013
Improved approximation algorithm for k-level UFL with penalties, a simplistic view on randomizing the scaling parameter
Jaroslaw Byrka, Shanfei Li, Bartosz Rybicki
The state of the art in approximation algorithms for facility location problems are complicated combinations of various techniques. In particular, the currently best 1.488-approxim…