{"id":"https://openalex.org/W7134960203","doi":"https://doi.org/10.48550/arxiv.2603.09846","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-03-10","ids":{"openalex":"https://openalex.org/W7134960203","doi":"https://doi.org/10.48550/arxiv.2603.09846"},"language":"en","primary_location":{"id":"pmh:doi:10.4230/lipics.socg.2026.34","is_oa":true,"landing_page_url":"http://proceedings.mlr.press/v70/braverman17a.html","pdf_url":"http://proceedings.mlr.press/v70/braverman17a/braverman17a.pdf","source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://proceedings.mlr.press/v70/braverman17a/braverman17a.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5128728310","display_name":"Vincent Cohen-Addad","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Cohen-Addad, Vincent","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128694563","display_name":"Karthik C. S.","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S., Karthik C.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128718978","display_name":"David Saulpic","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saulpic, David","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5128726873","display_name":"Chris Schwiegelshohn","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schwiegelshohn, Chris","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5128728310"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"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.8237000107765198,"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.8237000107765198,"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.04670000076293945,"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.02979999966919422,"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.6930999755859375},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.629800021648407},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6281999945640564},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5745999813079834},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5698000192642212},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.541700005531311},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49129998683929443},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.487199991941452}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7660999894142151},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6930999755859375},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.629800021648407},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6281999945640564},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5745999813079834},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5698000192642212},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5692999958992004},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.541700005531311},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49129998683929443},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.487199991941452},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43140000104904175},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.42089998722076416},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3765000104904175},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.37630000710487366},{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.3312000036239624},{"id":"https://openalex.org/C75432250","wikidata":"https://www.wikidata.org/wiki/Q29654355","display_name":"Real line","level":2,"score":0.3273000121116638},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29179999232292175},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2831000089645386},{"id":"https://openalex.org/C115328559","wikidata":"https://www.wikidata.org/wiki/Q4041956","display_name":"k-medians clustering","level":5,"score":0.27639999985694885},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C119322782","wikidata":"https://www.wikidata.org/wiki/Q2662236","display_name":"VC dimension","level":2,"score":0.2694000005722046},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25859999656677246},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.25769999623298645}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.4230/lipics.socg.2026.34","is_oa":true,"landing_page_url":"http://proceedings.mlr.press/v70/braverman17a.html","pdf_url":"http://proceedings.mlr.press/v70/braverman17a/braverman17a.pdf","source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"doi:10.48550/arxiv.2603.09846","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.09846","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"article"}],"best_oa_location":{"id":"pmh:doi:10.4230/lipics.socg.2026.34","is_oa":true,"landing_page_url":"http://proceedings.mlr.press/v70/braverman17a.html","pdf_url":"http://proceedings.mlr.press/v70/braverman17a/braverman17a.pdf","source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G106007106","display_name":null,"funder_award_id":"project A2","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G3052677248","display_name":null,"funder_award_id":"200021-184656","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G4915951725","display_name":"Randomness in Problem Instances and Randomized Algorithms","funder_award_id":"184656","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G5170398534","display_name":null,"funder_award_id":"1447639","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5256785375","display_name":null,"funder_award_id":"200021-","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G5425755426","display_name":null,"funder_award_id":"1652257","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5523801029","display_name":null,"funder_award_id":"SFB 876","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7651639761","display_name":null,"funder_award_id":"1650041","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G993971353","display_name":null,"funder_award_id":"200021","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320313934","display_name":"Institut national de recherche en informatique et en automatique (INRIA)","ror":"https://ror.org/02kvxyf05"},{"id":"https://openalex.org/F4320320177","display_name":"US-UK Fulbright Commission","ror":"https://ror.org/037nbwt68"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7134960203.pdf","grobid_xml":"https://content.openalex.org/works/W7134960203.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+\\varepsilon)$-factor":[70],"approximation":[71],"low-dimensional":[73],"Euclidean":[74],"both":[77],"problems":[82],"near-linear":[84],"time":[85,107],"$2^{(1/\\varepsilon)^{O(d^2)}}":[86],"n":[87,111],"\\cdot":[88,110,112],"\\text{polylog}(n)$":[89],"(where":[90],"$d$":[91],"dimension":[94],"$n$":[96],"number":[99],"input":[101],"points).":[102],"We":[103],"improve":[104],"this":[105],"running":[106],"$2^{\\tilde{O}(1/\\varepsilon)^{d-1}}":[109],"\\text{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/\\varepsilon^{d-1})}":[132],"n^{O(1)}$":[133],"algorithm":[134],"achieving":[135],"$(1+\\varepsilon)$-approximation":[137],"$k$-means.":[139]},"counts_by_year":[],"updated_date":"2026-06-05T09:01:59.212387","created_date":"2026-03-12T00:00:00"}