{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T05:48:05Z","timestamp":1771307285350,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540770497","type":"print"},{"value":"9783540770503","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-77050-3_6","type":"book-chapter","created":{"date-parts":[[2007,11,26]],"date-time":"2007-11-26T03:39:22Z","timestamp":1196048362000},"page":"71-83","source":"Crossref","is-referenced-by-count":4,"title":["The Priority k-Median Problem"],"prefix":"10.1007","author":[{"given":"Amit","family":"Kumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yogish","family":"Sabharwal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/276698.276718"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/380752.380755"},{"key":"6_CR3","unstructured":"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)"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/301250.301257"},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1109\/TNET.2004.826288","volume":"12","author":"M. Charikar","year":"2004","unstructured":"Charikar, M., Naor, J.S., Scheiber, B.: Resource optimization in QoS multicast routing of real-time multimedia. IEEE Transactions on Networking\u00a012(2), 340\u2013348 (2004)","journal-title":"IEEE Transactions on Networking"},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/3-540-69346-7_14","volume-title":"Integer Programming and Combinatorial Optimization","author":"Fabi\u00e1n A. Chudak","year":"1998","unstructured":"Chudak, F.: Improved approximation algorithms for uncapacitated facility location problem. In: Proceedings of the 6th Conference on Integer Programming and Combinatorial Optimization (1998)"},{"key":"6_CR7","unstructured":"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\u2013951 (2005)"},{"key":"6_CR8","unstructured":"Hochbaum, D.S.: Approximation Algorithms for NP-hard Problems. PWS Publishing (1996)"},{"key":"6_CR9","unstructured":"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)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithms - ESA\u201999","author":"S. Kolliopoulos","year":"1999","unstructured":"Kolliopoulos, S., Rao, S.: A nearly linear time approximation scheme for the Euclidean k-medians problem. In: Ne\u0161et\u0159il, J. (ed.) ESA 1999. LNCS, vol.\u00a01643, Springer, Heidelberg (1999)"},{"key":"6_CR11","unstructured":"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)"},{"key":"6_CR12","unstructured":"Kumar, A., Sabharwal, Y.: The Priority k-median Problem. Full version available, \n                    \n                      www.cse.iitd.ernet.in\/~yogish"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1007\/11523468_111"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Lin, J.H., Vitter, J.S.: \u03b5-approximations with minimum packing constraint violation. In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing (1992)","DOI":"10.1145\/129712.129787"},{"key":"6_CR15","volume-title":"Facilities Location: Models and Methods","author":"R.F. Love","year":"1998","unstructured":"Love, R.F., Morris, J.G., Wesolowsky, G.O.: Facilities Location: Models and Methods. North-Holland, Amsterdam (1998)"},{"key":"6_CR16","volume-title":"Discrete Location Theory","author":"P. Mirchandani","year":"1990","unstructured":"Mirchandani, P., Francis, R.: Discrete Location Theory. Wiley, New York (1990)"},{"key":"6_CR17","unstructured":"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\u20131097 (2004)"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/258533.258600"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77050-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:12:19Z","timestamp":1558264339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77050-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540770497","9783540770503"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77050-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}