Abstract
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.
Supported in part by NSF grant CCF 0514528.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alp, O., Erkut, E., Drezner, D.: An efficient genetic algorithm for the p-median problem. Annals of Operations Research 122, 21–42 (22) (2003)
Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. SIAM Journal on Computing 33, 544–562 (2004)
Beasley, J.E.: A note on solving large p-median problems. European Journal of Operational Research 21, 270–273 (1985)
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)
Chrobak, M., Kenyon, C., Noga, J., Young, N.E.: Incremental medians via online bidding. Algorithmica 50, 455–478 (2008)
Galvao, R.D., ReVelle, C.: A Lagrangean heuristic for the maximal covering location problem. European Journal of Operational Research 88(1), 114–123 (1996)
Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Greedy facility location algorithms analyzed using dual-fitting with factor-revealing LP. Journal of the ACM 50, 795–824 (2003)
Kariv, O., Hakimi, S.L.: An algorithm approach to network location problems ii. the p-medians. SIAM Journal of Applied Mathematics 37, 539–560 (1979)
Lin, G., Nagarajan, C., Rajaraman, R., Williamson, D.P.: A general approach for incremental approximation and hierarchical clustering. SIAM Journal on Computing 39, 3633–3669 (2010)
Mettu, R.R., Plaxton, C.G.: The online median problem. SIAM Journal on Computing 32, 816–832 (2003)
Plaxton, C.G.: Approximation algorithms for hierarchical location problems. Journal of Computer and System Sciences 72, 425–443 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nagarajan, C., Williamson, D.P. (2011). An Experimental Evaluation of Incremental and Hierarchical k-Median Algorithms. In: Pardalos, P.M., Rebennack, S. (eds) Experimental Algorithms. SEA 2011. Lecture Notes in Computer Science, vol 6630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20662-7_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-20662-7_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20661-0
Online ISBN: 978-3-642-20662-7
eBook Packages: Computer ScienceComputer Science (R0)