{"file":[{"date_updated":"2024-10-21T09:41:48Z","creator":"dernst","success":1,"file_id":"18454","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_name":"2024_LIPICs_DuprelaTour.pdf","checksum":"8e8c0b13049f11bb0133dfac22e32718","file_size":873561,"date_created":"2024-10-21T09:41:48Z"}],"language":[{"iso":"eng"}],"quality_controlled":"1","article_processing_charge":"Yes","volume":308,"year":"2024","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"_id":"18308","project":[{"call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564"},{"name":"Wittgenstein Award - Monika Henzinger","_id":"34def286-11ca-11ed-8bc3-da5948e1613c","grant_number":"Z00422"},{"name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982"},{"grant_number":"P33775 ","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer"},{"call_identifier":"H2020","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program"}],"license":"https://creativecommons.org/licenses/by/4.0/","abstract":[{"lang":"eng","text":"We study in this paper the problem of maintaining a solution to k-median and k-means clustering in a fully dynamic setting. To do so, we present an algorithm to efficiently maintain a coreset, a compressed version of the dataset, that allows easy computation of a clustering solution at query time. Our coreset algorithm has near-optimal update time of Õ(k) in general metric spaces, which reduces to Õ(d) in the Euclidean space ℝ^d. The query time is O(k²) in general metrics, and O(kd) in ℝ^d. To maintain a constant-factor approximation for k-median and k-means clustering in Euclidean space, this directly leads to an algorithm with update time Õ(d), and query time Õ(kd + k²). To maintain a O(polylog k)-approximation, the query time is reduced to Õ(kd)."}],"article_number":"100","ddc":["000"],"author":[{"first_name":"Max Dupré","last_name":"La Tour","full_name":"La Tour, Max Dupré"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Saulpic, David","id":"f8e48cf0-b0ff-11ed-b0e9-b4c35598f964","first_name":"David","last_name":"Saulpic"}],"intvolume":"       308","citation":{"ista":"La Tour MD, Henzinger MH, Saulpic D. 2024. Fully dynamic k-means coreset in near-optimal update time. 32nd Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 308, 100.","ama":"La Tour MD, Henzinger MH, Saulpic D. Fully dynamic k-means coreset in near-optimal update time. In: <i>32nd Annual European Symposium on Algorithms</i>. Vol 308. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2024.100\">10.4230/LIPIcs.ESA.2024.100</a>","apa":"La Tour, M. D., Henzinger, M. H., &#38; Saulpic, D. (2024). Fully dynamic k-means coreset in near-optimal update time. In <i>32nd Annual European Symposium on Algorithms</i> (Vol. 308). London, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2024.100\">https://doi.org/10.4230/LIPIcs.ESA.2024.100</a>","ieee":"M. D. La Tour, M. H. Henzinger, and D. Saulpic, “Fully dynamic k-means coreset in near-optimal update time,” in <i>32nd Annual European Symposium on Algorithms</i>, London, United Kingdom, 2024, vol. 308.","short":"M.D. La Tour, M.H. Henzinger, D. Saulpic, in:, 32nd Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","chicago":"La Tour, Max Dupré, Monika H Henzinger, and David Saulpic. “Fully Dynamic K-Means Coreset in near-Optimal Update Time.” In <i>32nd Annual European Symposium on Algorithms</i>, Vol. 308. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2024.100\">https://doi.org/10.4230/LIPIcs.ESA.2024.100</a>.","mla":"La Tour, Max Dupré, et al. “Fully Dynamic K-Means Coreset in near-Optimal Update Time.” <i>32nd Annual European Symposium on Algorithms</i>, vol. 308, 100, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2024.100\">10.4230/LIPIcs.ESA.2024.100</a>."},"scopus_import":"1","OA_place":"publisher","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file_date_updated":"2024-10-21T09:41:48Z","date_updated":"2024-10-22T13:08:00Z","type":"conference","acknowledgement":"Monika Henzinger: This project has received funding from the European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct Grant agreement No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024.\r\nDavid Saulpic: Work partially done while at ISTA. Received funding from the European Union’s\r\nHorizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 101034413. This work was partially funded by the grant ANR-19-CE48-0016 from the French National Research Agency (ANR).","alternative_title":["LIPIcs"],"department":[{"_id":"MoHe"}],"corr_author":"1","publication_status":"published","title":"Fully dynamic k-means coreset in near-optimal update time","oa":1,"day":"23","publication":"32nd Annual European Symposium on Algorithms","status":"public","conference":{"end_date":"2024-09-04","start_date":"2024-09-02","location":"London, United Kingdom","name":"ESA: European Symposium on Algorithms"},"date_created":"2024-10-13T22:01:50Z","oa_version":"Published Version","month":"09","date_published":"2024-09-23T00:00:00Z","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773386"]},"has_accepted_license":"1","doi":"10.4230/LIPIcs.ESA.2024.100","ec_funded":1,"external_id":{"arxiv":["2406.19926"]},"OA_type":"gold"}