{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:23:25Z","timestamp":1761895405623},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003878"},{"type":"electronic","value":"9783642555374"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-642-55537-4_60","type":"book-chapter","created":{"date-parts":[[2011,12,15]],"date-time":"2011-12-15T20:12:30Z","timestamp":1323979950000},"page":"371-376","source":"Crossref","is-referenced-by-count":6,"title":["Approximation Algorithms for the k-center Problem: An Experimental Evaluation"],"prefix":"10.1007","author":[{"given":"Jurij","family":"Miheli\u010d","sequence":"first","affiliation":[]},{"given":"Borut","family":"Robi\u010d","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"60_CR1","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0377-2217(85)90040-2","volume":"21","author":"JE Beasley","year":"1985","unstructured":"J. E. Beasley. A note on solving large p-median problems. European J. Oper Res., 21:270\u2013273, 1985.","journal-title":"J. Oper Res."},{"key":"60_CR2","volume-title":"Models Algorithms and Applications","author":"S Mark","year":"1995","unstructured":"Mark S. Daskin. Network and Discrete Location: Models Algorithms and Applications. Wiley, New York, 1995."},{"key":"60_CR3","first-page":"428","volume":"9","author":"S Mark","year":"2000","unstructured":"Mark S. Daskin. A new approach to solving the vertex p-center problem to optimality: Algorithm and computational results. Communications of the Operations Research Society of Japan, 45:9:428\u2013436, 2000.","journal-title":"Communications of the Operations Research Society of Japan, 45"},{"key":"60_CR4","unstructured":"Sourour Elloumi, Martine Labbe, and Yves Pochet. New formulation and resolution method for the p-center problem. 200l."},{"key":"60_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H.","author":"MR Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., San Francisco, 1979."},{"key":"60_CR6","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T Gonzalez","year":"1985","unstructured":"T. Gonzalez. Clustering to minimize the maximum inercluster distance. Theoretical Computer Sci ence., 38:293\u2013306, 1985.","journal-title":"Theoretical Computer Sci ence."},{"volume-title":"Approximation Algorithms for NP-hard Problems","year":"1995","key":"60_CR7","unstructured":"Dorit S. Hochbaum, editor. Approximation Algorithms for NP-hard Problems. PWS publishing company, Boston, 1995."},{"key":"60_CR8","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"S Dorit","year":"1985","unstructured":"Dorit S. Hochbaum and David B. Shmoys. A best possible heuristic for the k-center problem. Mathematics of Operations Research, 10:180\u2013184, 1985.","journal-title":"Mathematics of Operations Research"},{"key":"60_CR9","unstructured":"Taylan Ilhan and Mustafa Pinar. An efficient exact algorithm for the vertex p-center problem. 200l."},{"key":"60_CR10","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1137\/1012016","volume":"12","author":"E Minieka","year":"1970","unstructured":"E. Minieka. The m-center problem. SIAM Rev., 12:138\u2013139, 1970.","journal-title":"SIAM Rev."},{"key":"60_CR11","unstructured":"N. Mladenovic, M. Labbe, and P. Hansen. Solving the p-center problem with tabu search and variable neighborhood search. 2000. http:\/\/smg.ulb.ac.be\/Preprints\/Labbe00.20.html be\/Preprints\/Labbe00.20.html"},{"key":"60_CR12","doi-asserted-by":"crossref","unstructured":"David B. Shmoys. Computing near-optimal solutions to combinatorial optimization problems. Technical report, Ithaca, NY 14853, 1995. http:\/\/citeseer.nj.nec.com\/shmoys95computing.html.","DOI":"10.1090\/dimacs\/020\/07"}],"container-title":["Operations Research Proceedings 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-55537-4_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T00:28:20Z","timestamp":1561076900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-55537-4_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540003878","9783642555374"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-55537-4_60","relation":{},"subject":[],"published":{"date-parts":[[2003]]}}}