{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:36:16Z","timestamp":1725564976603},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228561"},{"type":"electronic","value":"9783540277989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27798-9_38","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:01:28Z","timestamp":1283727688000},"page":"349-359","source":"Crossref","is-referenced-by-count":23,"title":["k-Center Problems with Minimum Coverage"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Lim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brian","family":"Rodrigues","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhou","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"38_CR1","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1006\/jagm.1993.1047","volume":"15","author":"J. Bar-Ilan","year":"1993","unstructured":"Bar-Ilan, J., Kortsarz, G., Peleg, D.: How to allocate network centers. Journal of Algorithms\u00a015(3), 385\u2013415 (1993)","journal-title":"Journal of Algorithms"},{"key":"38_CR2","volume-title":"Computers and Intractability \u2013 A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability \u2013 A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"D. Hochbaum","year":"1985","unstructured":"Hochbaum, D., Shmoys, D.B.: A best possible heuristic for the k-center problem. Mathematics of Operations Research\u00a010, 180\u2013184 (1985)","journal-title":"Mathematics of Operations Research"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/5925.5933","volume":"33","author":"D. Hochbaum","year":"1986","unstructured":"Hochbaum, D., Shmoys, D.B.: A unified approach to approximation algorithms for bottleneck problems. Journal of the ACM\u00a033, 533\u2013550 (1986)","journal-title":"Journal of the ACM"},{"key":"38_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0166-218X(79)90044-1","volume":"1","author":"W. Hsu","year":"1979","unstructured":"Hsu, W., Nemhauser, G.: Easy and hard bottleneck location problems. Discrete Applied Mathematics\u00a01, 209\u2013216 (1979)","journal-title":"Discrete Applied Mathematics"},{"issue":"1-2","key":"38_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(98)00222-9","volume":"242","author":"S. Khuller","year":"2000","unstructured":"Khuller, S., Pless, R., Sussmann, Y.J.: Fault tolerant k-center problems. Theoretical Computer Science\u00a0242(1-2), 237\u2013245 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"38_CR7","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/S0895480197329776","volume":"13","author":"S. Khuller","year":"2000","unstructured":"Khuller, S., Sussmann, Y.J.: The capacitated k-center problem. SIAM Journal on Discrete Mathematics\u00a013(3), 403\u2013418 (2000)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"2","key":"38_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0020-0190(95)00141-X","volume":"56","author":"S.O. Krumke","year":"1995","unstructured":"Krumke, S.O.: On a generalization of the p-center problem. Information Processing Letters\u00a056(2), 67\u201371 (1995)","journal-title":"Information Processing Letters"},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0166-218X(87)90029-1","volume":"17","author":"J. Plesnik","year":"1987","unstructured":"Plesnik, J.: A heuristic for the p-center problem in graphs. Discrete Applied Mathematics\u00a017, 263\u2013268 (1987)","journal-title":"Discrete Applied Mathematics"},{"unstructured":"Xu, Z., Lim, A., Rodrigues, B., Wang, F.: Coverage commitment k-center problems (long version) (September 2003), \n                    \n                      http:\/\/www.comp.nus.edu.sg\/~judge\/doc.html\n                    \n                    \n                   (unpublished)","key":"38_CR10"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27798-9_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:26:37Z","timestamp":1620012397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27798-9_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228561","9783540277989"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27798-9_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}