{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:04:21Z","timestamp":1761807861041},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439500"},{"type":"electronic","value":"9783662439517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_39","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T04:37:49Z","timestamp":1402461469000},"page":"459-470","source":"Crossref","is-referenced-by-count":11,"title":["Facility Location in Evolving Metrics"],"prefix":"10.1007","author":[{"given":"David","family":"Eisenstat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claire","family":"Mathieu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Schabanel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.ic.2004.06.002","volume":"194","author":"A. Anagnostopoulos","year":"2004","unstructured":"Anagnostopoulos, A., Bent, R., Upfal, E., Van Hentenryck, P.: A simple and deterministic competitive algorithm for online facility location. Information and Computation\u00a0194, 175\u2013202 (2004)","journal-title":"Information and Computation"},{"issue":"3","key":"39_CR2","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1137\/S0097539702416402","volume":"33","author":"V. Arya","year":"2004","unstructured":"Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. SIAM J. on Computing\u00a033(3), 544\u2013562 (2004)","journal-title":"SIAM J. on Computing"},{"issue":"6","key":"39_CR3","doi-asserted-by":"publisher","first-page":"2212","DOI":"10.1137\/070708901","volume":"39","author":"J. Byrka","year":"2010","unstructured":"Byrka, J., Aardal, K.: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. SIAM J. on Computing\u00a039(6), 2212\u20132231 (2010)","journal-title":"SIAM J. on Computing"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chekuri, C., Feder, T., Motwani, R.: Incremental clustering and dynamic information retrieval. In: STOC, pp. 626\u2013635 (1997)","DOI":"10.1145\/258533.258657"},{"issue":"4","key":"39_CR5","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1137\/S0097539701398594","volume":"34","author":"M. Charikar","year":"2005","unstructured":"Charikar, M., Guha, S.: Improved combinatorial algorithms for facility location problems. SIAM J. on Computing\u00a034(4), 803\u2013824 (2005)","journal-title":"SIAM J. on Computing"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Charikar, M., Panigrahy, R.: Clustering to minimize the sum of cluster diameters. In: STOC, pp. 1\u201310 (2001)","DOI":"10.1145\/380752.380753"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Dinur, I., Steurer, D.: Analytical approach to parallel repetition. In: STOC 2014, arXiv:1305.1979 (2014)","DOI":"10.1145\/2591796.2591884"},{"issue":"2","key":"39_CR8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10100-010-0153-8","volume":"19","author":"G. Div\u00e9ki","year":"2010","unstructured":"Div\u00e9ki, G., Imreh, C.: Online facility location with facility movements. Central European J. of Operations Research\u00a019(2), 191\u2013200 (2010)","journal-title":"Central European J. of Operations Research"},{"key":"39_CR9","unstructured":"Fernandes, C.G., Oshiro, M.I., Schabanel, N.: Dynamic clustering of evolving networks: some results on the line. In: AlgoTel, 4 p. (2013), hal-00818985"},{"issue":"2-3","key":"39_CR10","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.tcs.2006.05.015","volume":"361","author":"D. Fotakis","year":"2006","unstructured":"Fotakis, D.: Incremental algorithms for facility location and k-median. Theoretical Computer Science\u00a0361(2-3), 275\u2013313 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"39_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00453-007-9049-y","volume":"50","author":"D. Fotakis","year":"2008","unstructured":"Fotakis, D.: On the competitive ratio for online facility location. Algorithmica\u00a050(1), 1\u201357 (2008)","journal-title":"Algorithmica"},{"issue":"1","key":"39_CR12","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/1959045.1959065","volume":"42","author":"D. Fotakis","year":"2011","unstructured":"Fotakis, D.: Online and incremental algorithms for facility location. SIGACT News\u00a042(1), 97\u2013131 (2011)","journal-title":"SIGACT News"},{"issue":"6","key":"39_CR13","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1145\/950620.950621","volume":"50","author":"K. Jain","year":"2003","unstructured":"Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing lp. J. ACM\u00a050(6), 795\u2013824 (2003)","journal-title":"J. ACM"},{"key":"39_CR14","unstructured":"Kleinberg, J.M.: The small-world phenomenon and decentralized search. SIAM News\u00a037(3) (2004)"},{"key":"39_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-22012-8_5","volume-title":"Automata, Languages and Programming","author":"S. Li","year":"2011","unstructured":"Li, S.: A 1.488 approximation algorithm for the uncapacitated facility location problem. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 77\u201388. Springer, Heidelberg (2011)"},{"key":"39_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-45753-4_20","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M. Mahdian","year":"2002","unstructured":"Mahdian, M., Ye, Y., Zhang, J.: Improved approximation algorithms for metric facility location problems. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol.\u00a02462, pp. 229\u2013242. Springer, Heidelberg (2002)"},{"key":"39_CR17","doi-asserted-by":"crossref","unstructured":"Meyerson, A.: Online facility location. In: FOCS, vol.\u00a042, pp. 426\u2013431 (2001)","DOI":"10.1109\/SFCS.2001.959917"},{"issue":"2","key":"39_CR18","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M.E.J. Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Review\u00a045(2), 167\u2013256 (2003)","journal-title":"SIAM Review"},{"key":"39_CR19","doi-asserted-by":"publisher","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. Physical Review Letters\u00a086, 3200\u20133203 (2001)","journal-title":"Physical Review Letters"},{"key":"39_CR20","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tardos, E., Aardal, K.I.: Approximation algorithms for facility location problems. In: STOC, vol.\u00a029, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"issue":"8","key":"39_CR21","doi-asserted-by":"publisher","first-page":"23176","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.-F., Quaggiotto, M., Van den Broeck, W., R\u00e9gis, C., Lina, B., Vanhems, P.: High-resolution measurements of face-to-face contact patterns in a primary school. PLoS ONE\u00a06(8), 23176 (2011)","journal-title":"PLoS ONE"},{"key":"39_CR22","doi-asserted-by":"crossref","unstructured":"Tantipathananandh, C., Berger-Wolf, T.Y., Kempe, D.: A framework for community identification in dynamic social networks. In: KDD, pp. 717\u2013726 (2007)","DOI":"10.1145\/1281192.1281269"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:16:42Z","timestamp":1558909002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}