Incremental Medians via Online Bidding

  title={Incremental Medians via Online Bidding},
  author={Marek Chrobak and Claire Mathieu and John Noga and Neal E. Young},
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 distance between u and a facility in F. The goal is to find a set F of k facilities that minimizes the sum, over all customers, of their service costs. Following the work of Mettu and Plaxton, we study the incremental medians problem, where k is not known in advance. An incremental algorithm produces a nested sequence… CONTINUE READING
19 Extracted Citations
28 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.

Similar Papers

Loading similar papers…