{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:04:29Z","timestamp":1746331469331,"version":"3.40.4"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319084039"},{"type":"electronic","value":"9783319084046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08404-6_5","type":"book-chapter","created":{"date-parts":[[2014,6,25]],"date-time":"2014-06-25T03:55:08Z","timestamp":1403668508000},"page":"50-61","source":"Crossref","is-referenced-by-count":2,"title":["New Approximability Results for the Robust k-Median Problem"],"prefix":"10.1007","author":[{"given":"Sayan","family":"Bhattacharya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Parinya","family":"Chalermsook","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian","family":"Neumann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Anthony, B.M., Goyal, V., Gupta, A., Nagarajan, V.: A plant location guide for the unsure: Approximation algorithms for min-max location problems. Math. Oper. Res.\u00a035(1), 79\u2013101 (2010) (Also in SODA 2008)","DOI":"10.1287\/moor.1090.0428"},{"issue":"5","key":"5_CR2","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. J. ACM\u00a045(5), 753\u2013782 (1998)","journal-title":"J. ACM"},{"issue":"3","key":"5_CR3","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM\u00a045(3), 501\u2013555 (1998)","journal-title":"J. ACM"},{"issue":"3","key":"5_CR4","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1137\/S0097539702416402","volume":"33","author":"V. Arya","year":"2004","unstructured":"Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. SIAM J. Comput.\u00a033(3), 544\u2013562 (2004)","journal-title":"SIAM J. Comput."},{"issue":"1-2","key":"5_CR5","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10107-012-0537-8","volume":"141","author":"N. Bansal","year":"2013","unstructured":"Bansal, N., Khandekar, R., K\u00f6nemann, J., Nagarajan, V., Peis, B.: On generalizations of network design problems with degree bounds. Math. Program.\u00a0141(1-2), 479\u2013506 (2013)","journal-title":"Math. Program."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and k-median problems. In: FOCS, pp. 378\u2013388. IEEE Computer Society (1999)","DOI":"10.1109\/SFFCS.1999.814609"},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jcss.2002.1882","volume":"65","author":"M. Charikar","year":"2002","unstructured":"Charikar, M., Guha, S., Tardos, \u00c9., Shmoys, D.B.: A constant-factor approximation algorithm for the k-median problem. J. Comput. Syst. Sci.\u00a065(1), 129\u2013149 (2002)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"5_CR8","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"issue":"6","key":"5_CR9","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"33","author":"T. Hagerup","year":"1990","unstructured":"Hagerup, T., R\u00fcb, C.: A guided tour of Chernoff bounds. Information Processing Letters\u00a033(6), 305\u2013308 (1990), http:\/\/www.sciencedirect.com\/science\/article\/pii\/002001909090214I","journal-title":"Information Processing Letters"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/3-540-48481-7_33","volume-title":"Algorithms - ESA\u201999","author":"S.G. Kolliopoulos","year":"1999","unstructured":"Kolliopoulos, S.G., Rao, S.: A nearly linear-time approximation scheme for the euclidean k-median problem. In: Ne\u0161et\u0159il, J. (ed.) ESA 1999. LNCS, vol.\u00a01643, pp. 378\u2013389. Springer, Heidelberg (1999)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Li, S., Svensson, O.: Approximating k-median via pseudo-approximation. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) STOC, pp. 901\u2013910. ACM (2013)","DOI":"10.1145\/2488608.2488723"},{"issue":"5","key":"5_CR12","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0020-0190(92)90208-D","volume":"44","author":"J.H. Lin","year":"1992","unstructured":"Lin, J.H., Vitter, J.S.: Approximation algorithms for geometric median problems. Inf. Process. Lett.\u00a044(5), 245\u2013249 (1992)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"5_CR13","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C. Lund","year":"1994","unstructured":"Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM\u00a041(5), 960\u2013981 (1994)","journal-title":"J. ACM"},{"issue":"3","key":"5_CR14","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1137\/S0097539795280895","volume":"27","author":"R. Raz","year":"1998","unstructured":"Raz, R.: A parallel repetition theorem. SIAM J. Comput.\u00a027(3), 763\u2013803 (1998)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08404-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T13:06:22Z","timestamp":1746277582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08404-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319084039","9783319084046"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08404-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}