A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Better bounds for incremental medians
2011
Theoretical Computer Science
In the incremental version of the well-known k-median problem, the objective is to compute an incremental sequence of facility sets F 1 ⊆ F 2 ⊆ · · · ⊆ F n , where each F k contains at most k facilities. We say that this incremental medians sequence is R-competitive if the cost of each F k is at most R times the optimum cost of k facilities. The smallest such R is called the competitive ratio of the sequence {F k }. 816-832] presented a polynomial-time algorithm that computes an incremental
doi:10.1016/j.tcs.2009.07.006
fatcat:exhgsfotgnhx3owvmo6opk3coy