An Experimental Evaluation of Incremental and Hierarchical k-Median Algorithms
In this paper, we consider different incremental and hierarchical k-median algorithms with provable performance guarantees and compare their running times and quality of output solutions on different benchmark k-median datasets. We determine that the quality of solutions output by these algorithms for all the datasets is much better than their performance guarantees suggest. Since some of the incremental k-median algorithms require approximate solutions for the k-median problem, we also compare some of the existing k-median algorithms’ running times and quality of solutions obtained on these datasets.
KeywordsLocal Search Greedy Algorithm Facility Location Competitive Ratio Local Search Algorithm
Unable to display preview. Download preview PDF.
- 4.Charikar, M., Guha, S., Tardos, E., Shmoys, D.B.: A constant-factor approximation algorithm for the k-median problem (extended abstract). In: Proceedings of the 31th Annual ACM Symposium on Theory of Computing, pp. 1–10 (1999)Google Scholar