{"id":"https://openalex.org/W7162538505","doi":"https://doi.org/10.4230/lipics.socg.2026.34","title":"Almost-Optimal Upper and Lower Bounds for Clustering in Low Dimensional Euclidean Spaces","display_name":"Almost-Optimal Upper and Lower Bounds for Clustering in Low Dimensional Euclidean Spaces","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7162538505","doi":"https://doi.org/10.4230/lipics.socg.2026.34"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25840","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.34","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.34/LIPIcs.SoCG.2026.34.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.34/LIPIcs.SoCG.2026.34.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074251728","display_name":"Vincent Cohen-Addad","orcid":"https://orcid.org/0000-0002-0779-8962"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Cohen-Addad, Vincent","raw_affiliation_strings":["Google Research, New York, NY, USA"],"raw_orcid":"https://orcid.org/0000-0002-0779-8962","affiliations":[{"raw_affiliation_string":"Google Research, New York, NY, USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066903534","display_name":"C. S. Karthik","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Karthik C. S.","raw_affiliation_strings":["Rutgers University, Piscataway, NJ, USA"],"raw_orcid":"https://orcid.org/0000-0001-9105-364X","affiliations":[{"raw_affiliation_string":"Rutgers University, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137157485","display_name":"David Saulpic","orcid":"https://orcid.org/0000-0003-4208-8541"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Saulpic, David","raw_affiliation_strings":["Universit\u00e9 Paris Cit\u00e9, CNRS, IRIF, F-75013, Paris, France"],"raw_orcid":"https://orcid.org/0000-0003-4208-8541","affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris Cit\u00e9, CNRS, IRIF, F-75013, Paris, France","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5137124748","display_name":"Chris Schwiegelshohn","orcid":"https://orcid.org/0009-0008-9114-0661"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Schwiegelshohn, Chris","raw_affiliation_strings":["Aarhus University, Denmark"],"raw_orcid":"https://orcid.org/0009-0008-9114-0661","affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5074251728"],"corresponding_institution_ids":["https://openalex.org/I1291425158"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.95733348,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.8596000075340271,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.8596000075340271,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.03060000017285347,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.018400000408291817,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6858999729156494},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6347000002861023},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6237000226974487},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5720000267028809},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5666000247001648},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.539900004863739},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48829999566078186},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.48330000042915344}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7662000060081482},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6858999729156494},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6347000002861023},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6237000226974487},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5964999794960022},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5720000267028809},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5666000247001648},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.539900004863739},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48829999566078186},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.48330000042915344},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4334000051021576},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.42010000348091125},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38589999079704285},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.37549999356269836},{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.33239999413490295},{"id":"https://openalex.org/C75432250","wikidata":"https://www.wikidata.org/wiki/Q29654355","display_name":"Real line","level":2,"score":0.32420000433921814},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.28459998965263367},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2800000011920929},{"id":"https://openalex.org/C119322782","wikidata":"https://www.wikidata.org/wiki/Q2662236","display_name":"VC dimension","level":2,"score":0.2786000072956085},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.2700999975204468},{"id":"https://openalex.org/C115328559","wikidata":"https://www.wikidata.org/wiki/Q4041956","display_name":"k-medians clustering","level":5,"score":0.26840001344680786},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.26260000467300415},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26010000705718994}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25840","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.34","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.34/LIPIcs.SoCG.2026.34.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.socg.2026.34","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.34","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25840","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.34","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.34/LIPIcs.SoCG.2026.34.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7162538505.pdf","grobid_xml":"https://content.openalex.org/works/W7162538505.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"k-median":[1,29,79],"and":[2,62,80,95,114],"k-means":[3,81],"clustering":[4,11],"objectives":[5,8],"are":[6],"classic":[7],"for":[9,76,127,138],"modeling":[10],"in":[12,21,72,83],"a":[13,17,22,69,136],"metric":[14,23,75],"space.":[15],"Given":[16],"set":[18],"of":[19,27,45,50,100],"points":[20,38],"space,":[24],"the":[25,28,43,46,78,93,98,122],"goal":[26],"(resp.":[30,48],"k-means)":[31],"problem":[32],"is":[33,92,97,130],"to":[34,41,56,67,108],"find":[35],"k":[36],"representative":[37],"so":[39],"as":[40],"minimize":[42],"sum":[44,49],"distances":[47],"squared":[51],"distances)":[52],"from":[53],"each":[54],"point":[55],"its":[57],"closest":[58],"representative.":[59],"Cohen-Addad,":[60],"Feldmann,":[61],"Saulpic":[63],"[JACM'21]":[64],"showed":[65],"how":[66],"obtain":[68],"(1+\u03b5)-factor":[70],"approximation":[71],"low-dimensional":[73],"Euclidean":[74],"both":[77],"problems":[82],"near-linear":[84],"time":[85,107],"2^{(1/\u03b5)^O(d\u00b2)}":[86],"n":[87,96,111],"\u22c5":[88,110,112],"polylog(n)":[89],"(where":[90],"d":[91],"dimension":[94],"number":[99],"input":[101],"points).":[102],"We":[103],"improve":[104],"this":[105],"running":[106],"2^{O(1/\u03b5)^{d-1}}":[109],"polylog(n),":[113],"show":[115],"an":[116],"almost":[117],"matching":[118],"lower":[119],"bound:":[120],"under":[121],"Gap":[123],"Exponential":[124],"Time":[125],"Hypothesis":[126],"3-SAT,":[128],"there":[129],"no":[131],"2^o(1/\u03b5^{d-1})":[132],"n^O(1)":[133],"algorithm":[134],"achieving":[135],"(1+\u03b5)-approximation":[137],"k-means.":[139]},"counts_by_year":[],"updated_date":"2026-05-30T09:04:40.226872","created_date":"2026-05-28T00:00:00"}