{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:36:42Z","timestamp":1725475002582},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496946"},{"type":"electronic","value":"9783540496960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940128_58","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T05:57:35Z","timestamp":1164779855000},"page":"578-587","source":"Crossref","is-referenced-by-count":4,"title":["Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii"],"prefix":"10.1007","author":[{"given":"Guido","family":"Proietti","sequence":"first","affiliation":[]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"58_CR1","doi-asserted-by":"crossref","unstructured":"Alt, H., Arkin, E.M., Br\u00f6nnimann, H., Erickson, J., Fekete, S.P., Knauer, C., Lenchner, J., Mitchell, J.S.B., Whittlesey, K.: Minimum-cost coverage of point sets by disks. In: Proc. 22nd ACM Symp. on Computat. Geometry (SoCG 2006), pp. 449\u2013458 (2006)","DOI":"10.1145\/1137856.1137922"},{"issue":"2","key":"58_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s00453-001-0110-y","volume":"33","author":"P.K. Agarwal","year":"2002","unstructured":"Agarwal, P.K., Procopiuc, C.M.: Exact and approximation algorithms for clustering. Algorithmica\u00a033(2), 201\u2013226 (2002)","journal-title":"Algorithmica"},{"key":"58_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/11561071_42","volume-title":"Algorithms \u2013 ESA 2005","author":"V. Bil\u00f3","year":"2005","unstructured":"Bil\u00f3, V., Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Geometric clustering to minimize the sum of cluster sizes. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 460\u2013471. Springer, Heidelberg (2005)"},{"issue":"2","key":"58_CR4","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.jcss.2003.07.014","volume":"68","author":"M. Charikar","year":"2004","unstructured":"Charikar, M., Panigrahy, R.: Clustering to minimize the sum of cluster diameters. J. of Computer and Systems Sciences\u00a068(2), 417\u2013441 (2004)","journal-title":"J. of Computer and Systems Sciences"},{"key":"58_CR5","doi-asserted-by":"crossref","first-page":"321","DOI":"10.2307\/2344237","volume":"134","author":"R.M. Cormack","year":"1971","unstructured":"Cormack, R.M.: A review of classification. J. of the Royal Statistical Society\u00a0134, 321\u2013367 (1971)","journal-title":"J. of the Royal Statistical Society"},{"issue":"3","key":"58_CR6","first-page":"185","volume":"7","author":"S.R. Doddi","year":"2000","unstructured":"Doddi, S.R., Marathe, M.V., Ravi, S.S., Taylor, D.S., Widmayer, P.: Approximation algorithms for clustering to minimize the sum of diameters. Nordic Journal of Computing\u00a07(3), 185\u2013203 (2000)","journal-title":"Nordic Journal of Computing"},{"issue":"23","key":"58_CR7","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T.F. Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comp. Science\u00a038(23), 293\u2013306 (1985)","journal-title":"Theor. Comp. Science"},{"key":"58_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":"58_CR9","first-page":"519","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. I: The p-centers. SIAM J. Applied Mathematics\u00a037(3), 519\u2013538 (1979)","journal-title":"SIAM J. Applied Mathematics"},{"key":"58_CR10","volume-title":"Handbooks in Operations Research and Management Science: Network Routing","author":"M. Labbe","year":"1995","unstructured":"Labbe, M., Peeters, D., Thisse, J.F.: Location on networks. In: Ball, M., Magnanti, T., Francis, R.L. (eds.) Handbooks in Operations Research and Management Science: Network Routing, Elsevier, Amsterdam (1995)"},{"issue":"4","key":"58_CR11","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.comnet.2004.08.012","volume":"47","author":"N. Lev-Tov","year":"2005","unstructured":"Lev-Tov, N., Peleg, D.: Polynomial time approximation schemes for base station coverage with minimum total radii. Computer Networks\u00a047(4), 489\u2013501 (2005)","journal-title":"Computer Networks"},{"issue":"6","key":"58_CR12","first-page":"445","volume":"25","author":"J. Plesn\u00edk","year":"1980","unstructured":"Plesn\u00edk, J.: On the computational complexity of centers locating in a graph. Aplikace Matematiky\u00a025(6), 445\u2013452 (1980)","journal-title":"Aplikace Matematiky"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:50:04Z","timestamp":1619509804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11940128_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}