{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:12:27Z","timestamp":1725466347877},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642311031"},{"type":"electronic","value":"9783642311048"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31104-8_2","type":"book-chapter","created":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T12:59:54Z","timestamp":1340629194000},"page":"13-24","source":"Crossref","is-referenced-by-count":2,"title":["The Fault Tolerant Capacitated k-Center Problem"],"prefix":"10.1007","author":[{"given":"Shiri","family":"Chechik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_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. J. Algorithms\u00a015, 385\u2013415 (1993)","journal-title":"J. Algorithms"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(99)00130-9","volume":"250","author":"J. Bar-Ilan","year":"2001","unstructured":"Bar-Ilan, J., Kortsarz, G., Peleg, D.: Generalized Submodular Cover Problems and Applications. Theoretical Computer Science\u00a0250, 179\u2013200 (2001)","journal-title":"Theoretical Computer Science"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0167-6377(85)90002-1","volume":"3","author":"M. Dyer","year":"1985","unstructured":"Dyer, M., Frieze, A.M.: A simple heuristic for the p-center problem. Oper. Res. Lett.\u00a03, 285\u2013288 (1985)","journal-title":"Oper. Res. Lett."},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0021-9800(70)80083-7","volume":"8","author":"J. Edmondsa","year":"1970","unstructured":"Edmondsa, J., Fulkersona, D.R.: Bottleneck extrema. J. Combinatorial Theory\u00a08, 299\u2013306 (1970)","journal-title":"J. Combinatorial Theory"},{"key":"2_CR5","volume-title":"Computers and Intractibility: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractibility: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1978)"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T. Gonzalez","year":"1985","unstructured":"Gonzalez, T.: Clustering to minimize the maximum intercluster distance. Theoretical Computer Science\u00a038, 293\u2013306 (1985)","journal-title":"Theoretical Computer Science"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Powers of graphs: A powerful approximation algorithm technique for bottleneck problems. In: Proc. 16th ACM Symp. on Theory of Computing, pp. 324\u2013333 (1984)","DOI":"10.1145\/800057.808697"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., 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"},{"issue":"3","key":"2_CR9","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/5925.5933","volume":"33","author":"D.S. Hochbaum","year":"1986","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A unified approach to approximation algorithms for bottleneck problems. J. ACM\u00a033(3), 533\u2013550 (1986)","journal-title":"J. ACM"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0166-218X(79)90044-1","volume":"1","author":"W.L. Hsu","year":"1979","unstructured":"Hsu, W.L., Nemhauser, G.L.: Easy and hard bottleneck location problems. Discrete Appl. Math.\u00a01, 209\u2013216 (1979)","journal-title":"Discrete Appl. Math."},{"key":"2_CR11","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.: Fault tolerant k-center problems. Theoretical Computer Science\u00a0242, 237\u2013245 (2000)","journal-title":"Theoretical Computer Science"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/S0895480197329776","volume":"13","author":"S. Khuller","year":"2000","unstructured":"Khuller, S., Sussmann, Y.: The Capacitated K-Center Problem. SIAM J. Discrete Math.\u00a013, 403\u2013418 (2000)","journal-title":"SIAM J. Discrete Math."},{"key":"2_CR13","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 Appl. Math.\u00a017, 263\u2013268 (1987)","journal-title":"Discrete Appl. Math."},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02579435","volume":"2","author":"L.A. Wolsey","year":"1982","unstructured":"Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica\u00a02, 385\u2013393 (1982)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31104-8_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:44:55Z","timestamp":1620128695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31104-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311031","9783642311048"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31104-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}