75 citations · 200 across the 26 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.DS2013★ 4 cited
A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median
Mohammadtaghi Hajiaghayi, Wei Hu, Jian Li +2
In this paper, we consider the fault-tolerant -median problem and give the \emph{first} constant factor approximation algorithm for it. In the fault-tolerant generalization of c…
cs.DS2013★ 5 cited
Matroid and Knapsack Center Problems
Danny Z. Chen, Jian Li, Hongyu Liang +1
In the classic -center problem, we are given a metric graph, and the objective is to open nodes as centers such that the maximum distance from any vertex to its closest cent…
cs.CG2013★ 5 cited
Efficient Algorithms for One-Dimensional k-Center Problems
Danny Z. Chen, Jian Li, Haitao Wang
We consider the problem of finding k centers for n weighted points on a real line. This (weighted) k-center problem was solved in O(n log n) time previously by using Cole's paramet…