596 citations · 3k across the 50 of their papers we have counts for
Showing 2005 · cs.DSShow all
2 papers · 2 filters
cs.DS2005★ 54 cited
The reverse greedy algorithm for the metric k-median problem
Marek Chrobak, Claire Kenyon, Neal E. Young
The Reverse Greedy algorithm (RGreedy) for the k-median problem works as follows. It starts by placing facilities on all nodes. At each step, it removes a facility to minimize the…
cs.DS2005★ 41 cited
Incremental Medians via Online Bidding
Marek Chrobak, Claire Kenyon, John Noga +1
In the k-median problem we are given sets of facilities and customers, and distances between them. For a given set F of facilities, the cost of serving a customer u is the minimum…