{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:48:32Z","timestamp":1774421312821,"version":"3.50.1"},"publisher-location":"New York, New York, USA","reference-count":16,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"French National Agency (ANR) under project FIELDS","award":["ANR-15-CE23- 0006"],"award-info":[{"award-number":["ANR-15-CE23- 0006"]}]},{"name":"Google Faculty Award"},{"name":"PROCORE France-Hong Kong Joint Research Scheme","award":["F-HKU702\/16"],"award-info":[{"award-number":["F-HKU702\/16"]}]},{"name":"Hong Kong RGC","award":["17217716"],"award-info":[{"award-number":["17217716"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3178876.3186124","type":"proceedings-article","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T15:53:48Z","timestamp":1523634828000},"page":"579-587","source":"Crossref","is-referenced-by-count":19,"title":["Fully Dynamic<i>k<\/i>-Center Clustering"],"prefix":"10.1145","author":[{"given":"T-H. Hubert","family":"Chan","sequence":"first","affiliation":[{"name":"University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Guerqin","sequence":"additional","affiliation":[{"name":"LTCI, T\u00e9l\u00e9com ParisTech University, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauro","family":"Sozio","sequence":"additional","affiliation":[{"name":"LTCI, T\u00e9l\u00e9com ParisTech University, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/3178876.3186124-1","unstructured":"S [1] R. P. L. A. Epasto, S. Lattanzi. Ego-splitting framework: from non-overalapping to overalapping clusters. In KDD 2017."},{"key":"key-10.1145\/3178876.3186124-2","unstructured":"D. Arthur and S. Vassilvitskii. k-means++: the advantages of careful seeding. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7--9, 2007, pages 1027--1035, 2007."},{"key":"key-10.1145\/3178876.3186124-3","doi-asserted-by":"crossref","unstructured":"B. Bahmani, B. Moseley, A. Vattani, R. Kumar, and S. Vassilvitskii. Scalable k-means++. PVLDB, 5(7):622--633, 2012.","DOI":"10.14778\/2180912.2180915"},{"key":"key-10.1145\/3178876.3186124-4","doi-asserted-by":"crossref","unstructured":"M. Charikar, C. Chekuri, T. Feder, and R. Motwani. Incremental clustering and dynamic information retrieval. In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pages 626--635. ACM, 1997.","DOI":"10.1145\/258533.258657"},{"key":"key-10.1145\/3178876.3186124-5","doi-asserted-by":"crossref","unstructured":"M. Charikar, L. O'Callaghan, and R. Panigrahy. Better streaming algorithms for clustering problems. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9--11, 2003, San Diego, CA, USA, pages 30--39, 2003.","DOI":"10.1145\/780542.780548"},{"key":"key-10.1145\/3178876.3186124-6","unstructured":"V. Cohen-Addad, C. Schwiegelshohn, and C. Sohler. Diameter and k-center in sliding windows. In 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11--15, 2016, Rome, Italy, pages 19:1--19:12, 2016."},{"key":"key-10.1145\/3178876.3186124-7","doi-asserted-by":"crossref","unstructured":"A. Epasto, S. Lattanzi, and M. Sozio. E#cient densest subgraph computation in evolving graphs. In Proceedings of the 24th International Conference on World Wide Web, WWW 2015, Florence, Italy, May 18--22, 2015, pages 300--310, 2015.","DOI":"10.1145\/2736277.2741638"},{"key":"key-10.1145\/3178876.3186124-8","unstructured":"S. L. F. Chierichetti, R. Kumar and S. Vassilvitskii. Fair clustering through fairlets. In NIPS, 2017."},{"key":"key-10.1145\/3178876.3186124-9","doi-asserted-by":"crossref","unstructured":"T. F. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38:293 -- 306, 1985.","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"key-10.1145\/3178876.3186124-10","doi-asserted-by":"crossref","unstructured":"S. Guha, N. Mishra, R. Motwani, and L. O'Callaghan. Clustering data streams. In 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12--14 November 2000, Redondo Beach, California, USA, pages 359--366, 2000.","DOI":"10.1109\/SFCS.2000.892124"},{"key":"key-10.1145\/3178876.3186124-11","doi-asserted-by":"crossref","unstructured":"S. Gupta, R. Kumar, K. Lu, B. Moseley, and S. Vassilvitskii. Local search methods for k-means with outliers. PVLDB, 10(7):757--768, 2017.","DOI":"10.14778\/3067421.3067425"},{"key":"key-10.1145\/3178876.3186124-12","unstructured":"S. Lattanzi and S. Vassilvitskii. Consistent k-clustering. In ICML, 2017."},{"key":"key-10.1145\/3178876.3186124-13","unstructured":"M. D. M. H. S. L. M. Bateni, S. Behnezhad and V. Mirrokni. On distributed hierarchical clustering. In NIPS 2017."},{"key":"key-10.1145\/3178876.3186124-14","doi-asserted-by":"crossref","unstructured":"R. Matthew Mccutchen and S. Khuller. Streaming algorithms for k-center clustering with outliers and with anonymity. APPROX '08 \/ RANDOM '08, pages 165--178, 2008.","DOI":"10.1007\/978-3-540-85363-3_14"},{"key":"key-10.1145\/3178876.3186124-15","unstructured":"H. Steinhaus. Mathematical Snapshots. 3rd ed. New York, 1999."},{"key":"key-10.1145\/3178876.3186124-16","unstructured":"A. A. Taha and A. Hanbury. An e#cient algorithm for calculating the exact hausdorff distance. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20"}],"event":{"name":"the 2018 World Wide Web Conference","location":"Lyon, France","acronym":"WWW '18","number":"2018","sponsor":["SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web","IW3C2, International World Wide Web Conference Committee"],"start":{"date-parts":[[2018,4,23]]},"end":{"date-parts":[[2018,4,27]]}},"container-title":["Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178876.3186124","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3186124&ftid=1957477&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:28Z","timestamp":1750212688000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3178876.3186124"}},"subtitle":[],"proceedings-subject":"World Wide Web","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1145\/3178876.3186124","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}