{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:05:45Z","timestamp":1743026745957,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030950170"},{"type":"electronic","value":"9783030950187"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95018-7_14","type":"book-chapter","created":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:05:04Z","timestamp":1642982704000},"page":"167-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Coresets for $$(k, \\ell )$$-Median Clustering Under the Fr\u00e9chet Distance"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3446-4343","authenticated-orcid":false,"given":"Maike","family":"Buchin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8984-1962","authenticated-orcid":false,"given":"Dennis","family":"Rohde","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,24]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1142\/S0218195995000064","volume":"5","author":"H Alt","year":"1995","unstructured":"Alt, H., Godau, M.: Computing the Fr\u00e9chet distance between two polygonal curves. Int. J. Comput. Geom. Appl. 5, 75\u201391 (1995)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"14_CR2","unstructured":"Braverman, V., Feldman, D., Lang, H.: New Frameworks for Offline and Streaming Coreset Constructions. CoRR abs\/1612.00889 (2016)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Braverman, V., Jiang, S.H., Krauthgamer, R., Wu, X.: Coresets for clustering in excluded-minor graphs and beyond. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, pp. 2679\u20132696. SIAM (2021)","DOI":"10.1137\/1.9781611976465.159"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Buchin, K., et al.: Approximating (k, l)-center clustering for curves. In: Proceedings of the 2019 ACM-SIAM Symposium on Discrete Algorithms, pp. 2922\u20132938 (2019)","DOI":"10.1137\/1.9781611975482.181"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Buchin, K., Driemel, A., van de L\u2019Isle, N., Nusser, A.: klcluster: center-based clustering of trajectories. In: Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 496\u2013499 (2019)","DOI":"10.1145\/3347146.3359111"},{"key":"14_CR6","unstructured":"Buchin, K., Driemel, A., Struijs, M.: On the hardness of computing an average curve. In: 17th Scandinavian Symposium and Workshops on Algorithm Theory. LIPIcs, vol. 162, pp. 19:1\u201319:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Buchin, M., Driemel, A., Rohde, D.: Approximating $$(k,\\ell )$$-Median Clustering for Polygonal Curves. arXiv e-prints arXiv:2009.01488 (2020)","DOI":"10.1137\/1.9781611976465.160"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Buchin, M., Driemel, A., Rohde, D.: Approximating $$(k,\\ell )$$-median clustering for polygonal curves. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, pp. 2697\u20132717. SIAM (2021)","DOI":"10.1137\/1.9781611976465.160"},{"key":"14_CR9","unstructured":"Buchin, M., Rohde, D.: Coresets for $$(k, l)$$-clustering under the Fr\u00e9chet distance. In: Proceedings of the 35th European Workshop on Computational Geometry (2019)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Buchin, M., Rohde, D.: Coresets for $$(k, \\ell )$$-Median Clustering under the Fr\u00e9chet Distance. CoRR abs\/2104.09392 (2021)","DOI":"10.1007\/978-3-030-95018-7_14"},{"issue":"3","key":"14_CR11","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1137\/070699007","volume":"39","author":"K Chen","year":"2009","unstructured":"Chen, K.: On coresets for k-median and k-means clustering in metric and euclidean spaces and their applications. SIAM J. Comput. 39(3), 923\u2013947 (2009)","journal-title":"SIAM J. Comput."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Driemel, A., Krivosija, A., Sohler, C.: Clustering time series under the Fr\u00e9chet distance. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 766\u2013785 (2016)","DOI":"10.1137\/1.9781611974331.ch55"},{"key":"14_CR13","unstructured":"Driemel, A., Phillips, J.M., Psarros, I.: The VC dimension of metric balls under Fr\u00e9chet and Hausdorff distances. In: 35th International Symposium on Computational Geometry, pp. 28:1\u201328:16 (2019)"},{"key":"14_CR14","unstructured":"Feldman, D.: Introduction to Core-sets: an Updated Survey. CoRR abs\/2011.09384 (2020)"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Feldman, D., Langberg, M.: A unified framework for approximating and clustering data. In: Proceedings of the 43rd ACM Symposium on Theory of Computing, pp. 569\u2013578. ACM (2011)","DOI":"10.1145\/1993636.1993712"},{"issue":"3","key":"14_CR16","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/18M1209854","volume":"49","author":"D Feldman","year":"2020","unstructured":"Feldman, D., Schmidt, M., Sohler, C.: Turning big data into tiny data: constant-size coresets for k-means, PCA, and projective clustering. SIAM J. Comput. 49(3), 601\u2013657 (2020)","journal-title":"SIAM J. Comput."},{"issue":"2\u20133","key":"14_CR17","first-page":"131","volume":"18","author":"PW Goldberg","year":"1995","unstructured":"Goldberg, P.W., Jerrum, M.: Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers. Mach. Learn. 18(2\u20133), 131\u2013148 (1995)","journal-title":"Mach. Learn."},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Har-Peled, S.: Geometric Approximation Algorithms. American Mathematical Society (2011)","DOI":"10.1090\/surv\/173"},{"issue":"1","key":"14_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00454-006-1271-x","volume":"37","author":"S Har-Peled","year":"2006","unstructured":"Har-Peled, S., Kushal, A.: Smaller coresets for k-median and k-means clustering. Discrete Comput. Geom. 37(1), 3\u201319 (2006). https:\/\/doi.org\/10.1007\/s00454-006-1271-x","journal-title":"Discrete Comput. Geom."},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Mazumdar, S.: On coresets for k-means and k-median clustering. In: Proceedings of the 2004 ACM Symposium on Theory of Computing, pp. 291\u2013300 (2004)","DOI":"10.1145\/1007352.1007400"},{"issue":"3","key":"14_CR21","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/s00454-010-9248-1","volume":"45","author":"S Har-Peled","year":"2011","unstructured":"Har-Peled, S., Sharir, M.: Relative (p,$$\\epsilon $$)-approximations in geometry. Discrete Comput. Geom. 45(3), 462\u2013496 (2011)","journal-title":"Discrete Comput. Geom."},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Huang, L., Jiang, S.H., Li, J., Wu, X.: Epsilon-coresets for clustering (with outliers) in doubling metrics. In: 59th IEEE Annual Symposium on Foundations of Computer Science, pp. 814\u2013825. IEEE Computer Society (2018)","DOI":"10.1109\/FOCS.2018.00082"},{"key":"14_CR23","first-page":"71","volume":"6","author":"H Imai","year":"1988","unstructured":"Imai, H., Iri, M.: Polygonal approximations of a curve - formulations and algorithms. Mach. Intelligence Pattern Recogn. 6, 71\u201386 (1988)","journal-title":"Mach. Intelligence Pattern Recogn."},{"key":"14_CR24","unstructured":"Indyk, P.: High-dimensional Computational Geometry. Ph.D. thesis, Stanford University, CA, USA (2000)"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Langberg, M., Schulman, L.J.: Universal epsilon-approximators for Integrals. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 598\u2013607 (2010)","DOI":"10.1137\/1.9781611973075.50"},{"key":"14_CR26","unstructured":"Meintrup, S., Munteanu, A., Rohde, D.: Random projections and sampling algorithms for clustering of high-dimensional polygonal curves. In: Advances in Neural Information Processing Systems 32, pp. 12807\u201312817 (2019)"},{"issue":"1","key":"14_CR27","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s13218-017-0519-3","volume":"32","author":"A Munteanu","year":"2017","unstructured":"Munteanu, A., Schwiegelshohn, C.: Coresets-methods and history: a theoreticians design pattern for approximation and streaming algorithms. KI - K\u00fcnstliche Intell. 32(1), 37\u201353 (2017). https:\/\/doi.org\/10.1007\/s13218-017-0519-3","journal-title":"KI - K\u00fcnstliche Intell."},{"key":"14_CR28","unstructured":"Munteanu, A., Schwiegelshohn, C., Sohler, C., Woodruff, D.P.: On coresets for logistic regression. In: Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, pp. 6562\u20136571 (2018)"},{"key":"14_CR29","unstructured":"Nath, A., Taylor, E.: k-median clustering under discrete Fr\u00e9chet and Hausdorff distances. In: 36th International Symposium on Computational Geometry. LIPIcs, vol. 164, pp. 58:1\u201358:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"14_CR30","unstructured":"Varadarajan, K.R., Xiao, X.: On the sensitivity of shape fitting problems. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. LIPIcs, vol. 18, pp. 486\u2013497 (2012)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95018-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T07:24:12Z","timestamp":1674545052000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95018-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030950170","9783030950187"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95018-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puducherry","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 February 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 February 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.acsdm.org\/caldam\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"80","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}