Abstract
In this paper, we consider a generalized version of the k-median problem in metric spaces, called the priority k-median problem in which demands and facilities have priorities associated with them and a demand can only be assigned to a facility that has the same priority or better. We show that there exists a polynomial time constant factor approximation algorithm for this problem when there are two priorities. We also show that the natural integer program for the problem has an arbitrarily large integrality gap when there are four or more priorities.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Arora, S., Raghavan, P., Rao, S.: Polynomial time approximation schemes for the Euclidean k-median problem. In: Proceedings of the 30th annual ACM Symposium on Theory of Computing (1998)
Arya, V., Garg, N., Khandekar, R., Pandit, V., Meyerson, A., Munagala, K.: Local search heuristics for k-median and facility location problems. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (2001)
Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and k-median problems. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (1999)
Charikar, M., Guha, S., Tardos, E., Shmoys, D.: A constant-factor approximation algorithm for the k-median problem. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (1999)
Charikar, M., Naor, J.S., Scheiber, B.: Resource optimization in QoS multicast routing of real-time multimedia. IEEE Transactions on Networking 12(2), 340–348 (2004)
Chudak, F.: Improved approximation algorithms for uncapacitated facility location problem. In: Proceedings of the 6th Conference on Integer Programming and Combinatorial Optimization (1998)
Chuzhoy, J., Gupta, A., Naor, J., Sinha, A.: On the approximability of some network design problems. In: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 943–951 (2005)
Hochbaum, D.S.: Approximation Algorithms for NP-hard Problems. PWS Publishing (1996)
Jain, K., Vazirani, V.: Primal-dual approximation algorithms for the metric facility location and k-median problems. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (1999)
Kolliopoulos, S., Rao, S.: A nearly linear time approximation scheme for the Euclidean k-medians problem. In: Nešetřil, J. (ed.) ESA 1999. LNCS, vol. 1643, Springer, Heidelberg (1999)
Korupolu, M., Plaxton, C., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (1998)
Kumar, A., Sabharwal, Y.: The Priority k-median Problem. Full version available, www.cse.iitd.ernet.in/~yogish
Kumar, A., Sabharwal, Y., Sen, S.: Linear time approximation algorithms for clustering problems in any dimensions. In: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (2005)
Lin, J.H., Vitter, J.S.: ε-approximations with minimum packing constraint violation. In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing (1992)
Love, R.F., Morris, J.G., Wesolowsky, G.O.: Facilities Location: Models and Methods. North-Holland, Amsterdam (1998)
Mirchandani, P., Francis, R.: Discrete Location Theory. Wiley, New York (1990)
Shmoys, D.B., Swamy, C., Levi, R.: Facility location with service installation costs. In: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 1088–1097 (2004)
Shmoys, D., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kumar, A., Sabharwal, Y. (2007). The Priority k-Median Problem. In: Arvind, V., Prasad, S. (eds) FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2007. Lecture Notes in Computer Science, vol 4855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77050-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-77050-3_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77049-7
Online ISBN: 978-3-540-77050-3
eBook Packages: Computer ScienceComputer Science (R0)