5 citations · 7 across the 3 of their papers we have counts for
3 papers
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.NI2009★ 2 cited
On Computing Compression Trees for Data Collection in Sensor Networks
Jian Li, Amol Deshpande, Samir Khuller
We address the problem of efficiently gathering correlated data from a wired or a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees,…
cs.DB2008
Consensus Answers for Queries over Probabilistic Databases
Jian Li, Amol Deshpande
We address the problem of finding a "best" deterministic query answer to a query over a probabilistic database. For this purpose, we propose the notion of a consensus world (or a c…