{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:33Z","timestamp":1759638333843},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319539249"},{"type":"electronic","value":"9783319539256"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53925-6_3","type":"book-chapter","created":{"date-parts":[[2017,2,19]],"date-time":"2017-02-19T20:12:36Z","timestamp":1487535156000},"page":"30-41","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic Sum-Radii Clustering"],"prefix":"10.1007","author":[{"given":"Nicolas K.","family":"Blanchard","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Schabanel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,21]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45(2), 167\u2013256 (2003)","journal-title":"SIAM Rev."},{"issue":"8","key":"3_CR2","doi-asserted-by":"crossref","first-page":"e23176","DOI":"10.1371\/journal.pone.0023176","volume":"6","author":"J Stehl\u00e9","year":"2011","unstructured":"Stehl\u00e9, J., Voirin, N., Barrat, A., Cattuto, C., Isella, L., Pinton, J., Quaggiotto, M., den Broeck, W.V., R\u00e9gis, C., Lina, B., Vanhems, P.: High-resolution measurements of face-to-face contact patterns in a primary school. PLoS ONE 6(8), e23176 (2011)","journal-title":"PLoS ONE"},{"issue":"1","key":"3_CR3","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/s00442-006-0553-6","volume":"151","author":"SR Sundaresan","year":"2007","unstructured":"Sundaresan, S.R., Fischhoff, I.R., Dushoff, J., Rubenstein, D.I.: Network metrics reveal differences in social organization between two fission-fusion species, grevy\u2019s zebra and onager. Oecologia 151(1), 140\u2013149 (2007)","journal-title":"Oecologia"},{"key":"3_CR4","doi-asserted-by":"crossref","first-page":"3200","DOI":"10.1103\/PhysRevLett.86.3200","volume":"86","author":"R Pastor-Satorras","year":"2001","unstructured":"Pastor-Satorras, R., Vespignani, A.: Epidemic spreading in scale-free networks. Phys. Rev. Lett. 86, 3200\u20133203 (2001)","journal-title":"Phys. Rev. Lett."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Tantipathananandh, C., Berger-Wolf, T.Y., Kempe, D.: A framework for community identification in dynamic social networks. In: SIGKDD, pp. 717\u2013726 (2007)","DOI":"10.1145\/1281192.1281269"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-642-32589-2_36","volume-title":"Mathematical Foundations of Computer Science 2012","author":"D Fotakis","year":"2012","unstructured":"Fotakis, D., Koutris, P.: Online sum-radii clustering. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 395\u2013406. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-32589-2_36"},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.ic.2012.01.007","volume":"222","author":"S Li","year":"2013","unstructured":"Li, S.: A 1.488 approximation algorithm for the uncapacitated facility location problem. Inf. Comput. 222, 45\u201358 (2013)","journal-title":"Inf. Comput."},{"issue":"2","key":"3_CR8","doi-asserted-by":"crossref","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. Comput. Syst. Sci. 68(2), 417\u2013441 (2004)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"3_CR9","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1006\/jagm.1998.0993","volume":"31","author":"S Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. J. Algorithms 31(1), 228\u2013248 (1999)","journal-title":"J. Algorithms"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-662-43951-7_39","volume-title":"Automata, Languages, and Programming","author":"D Eisenstat","year":"2014","unstructured":"Eisenstat, D., Mathieu, C., Schabanel, N.: Facility location in evolving metrics. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 459\u2013470. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-43951-7_39"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"An, H., Norouzi-Fard, A., Svensson, O.: Dynamic facility location via exponential clocks. In: SODA, pp. 708\u2013721 (2015)","DOI":"10.1137\/1.9781611973730.48"},{"key":"3_CR12","unstructured":"Fernandes, C.G., Oshiro, M.T., Schabanel, N.: Dynamic clustering of evolving networks: some results on the line. In: AlgoTel, pp. 1\u20134, May 2013"},{"issue":"2","key":"3_CR13","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/S0097539703435716","volume":"36","author":"M Mahdian","year":"2006","unstructured":"Mahdian, M., Ye, Y., Zhang, J.: Approximation algorithms for metric facility location problems. SIAM J. Comput. 36(2), 411\u2013432 (2006)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"3_CR14","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s00453-014-9907-3","volume":"73","author":"B Behsaz","year":"2015","unstructured":"Behsaz, B., Salavatipour, M.R.: On minimum sum of radii and diameters clustering. Algorithmica 73(1), 143\u2013165 (2015)","journal-title":"Algorithmica"},{"issue":"1","key":"3_CR15","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/BF01581035","volume":"22","author":"DS Hochbaum","year":"1982","unstructured":"Hochbaum, D.S.: Heuristics for the fixed cost median problem. Math. Program. 22(1), 148\u2013162 (1982)","journal-title":"Math. Program."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Dinur, I., Steurer, D.: Analytical approach to parallel repetition. In: STOC, pp. 624\u2013633 (2014)","DOI":"10.1145\/2591796.2591884"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Lee, Y.T., Sidford, A.: Path finding methods for linear programming: solving linear programs in \u00d5(vrank) iterations and faster algorithms for maximum flow. In: Proceedings of the 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, FOCS 2014, pp. 424\u2013433. IEEE Computer Society, Washington (2014)","DOI":"10.1109\/FOCS.2014.52"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53925-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T06:54:18Z","timestamp":1498373658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53925-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319539249","9783319539256"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53925-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}