{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:47:33Z","timestamp":1725497253551},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540771180"},{"type":"electronic","value":"9783540771203"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-77120-3_51","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:31:09Z","timestamp":1196940669000},"page":"587-598","source":"Crossref","is-referenced-by-count":1,"title":["Locating Facilities on a Network to Minimize Their Average Service Radius"],"prefix":"10.1007","author":[{"given":"Davide","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"J\u00f6rg","family":"Derungs","sequence":"additional","affiliation":[]},{"given":"Luciano","family":"Gual\u00e0","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"51_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 Computational Geometry (SoCG 2006), pp. 449\u2013458 (2006)","DOI":"10.1145\/1137856.1137922"},{"key":"51_CR2","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)"},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. In: Proc. of the 25th ACM Symp. on Theory of Computing (STOC 1993), pp. 226\u2013234 (1993)","DOI":"10.1145\/167088.167161"},{"issue":"2","key":"51_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":"51_CR5","volume-title":"Facility Location: Applications and Theory","author":"Z. Drezner","year":"2004","unstructured":"Drezner, Z., Hamacher, H.W.: Facility Location: Applications and Theory. Springer, Heidelberg (2004)"},{"key":"51_CR6","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems, Part I: The p-centers. SIAM Journal on Applied Mathematics\u00a037, 513\u2013538 (1979)","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"3","key":"51_CR7","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems, Part II: The p-medians. SIAM Journal on Applied Mathematics\u00a037(3), 539\u2013560 (1979)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"51_CR8","volume-title":"Handbooks in Operations Research and Management Science: Network Routing","author":"M. Labb\u00e9","year":"1995","unstructured":"Labb\u00e9, 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":"51_CR9","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"},{"volume-title":"Discrete location theory","year":"1990","key":"51_CR10","unstructured":"Mirchandani, P.B., Francis, R.L. (eds.): Discrete location theory. Wiley, New York (1990)"},{"issue":"4","key":"51_CR11","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1137\/0212051","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N., Tamir, A.: New results on the complexity of p-center problems. SIAM Journal on Computing\u00a012(4), 751\u2013758 (1983)","journal-title":"SIAM Journal on Computing"},{"key":"51_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/11940128_58","volume-title":"Algorithms and Computation","author":"G. Proietti","year":"2006","unstructured":"Proietti, G., Widmayer, P.: Partitioning the nodes of a graph to minimize the sum of subgraph radii. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 578\u2013587. Springer, Heidelberg (2006)"},{"key":"51_CR13","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms\u00a07, 309\u2013322 (1986)","journal-title":"J. Algorithms"},{"issue":"2","key":"51_CR14","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0167-6377(96)00021-1","volume":"19","author":"A. Tamir","year":"1996","unstructured":"Tamir, A.: An O(pn\n                  2) algorithm for the p-median and related problems on tree graphs. Operations Research Letters\u00a019(2), 59\u201364 (1996)","journal-title":"Operations Research Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77120-3_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:27:10Z","timestamp":1558279630000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77120-3_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540771180","9783540771203"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77120-3_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}