{"id":"https://openalex.org/W7147717823","doi":"https://doi.org/10.48550/arxiv.2603.28265","title":"Fine-Grained Complexity of Continuous Euclidean k-Center","display_name":"Fine-Grained Complexity of Continuous Euclidean k-Center","publication_year":2026,"publication_date":"2026-03-30","ids":{"openalex":"https://openalex.org/W7147717823","doi":"https://doi.org/10.48550/arxiv.2603.28265"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.28265","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.28265","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":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.28265","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113204598","display_name":"Lotte Blank","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Blank, Lotte","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044394587","display_name":"Karl Bringmann","orcid":"https://orcid.org/0000-0003-1356-5177"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bringmann, Karl","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016828567","display_name":"Parinya Chalermsook","orcid":"https://orcid.org/0009-0000-2833-0472"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chalermsook, Parinya","raw_affiliation_strings":[],"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":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001011989","display_name":"Benedikt Kolbe","orcid":"https://orcid.org/0009-0005-0440-4912"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kolbe, Benedikt","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132604008","display_name":"Hung Le","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Le, Hung","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5132702757","display_name":"Geert van Wordragen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"van Wordragen, Geert","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5113204598"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"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.5867999792098999,"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.5867999792098999,"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.32190001010894775,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.009999999776482582,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/euclidean-geometry","display_name":"Euclidean geometry","score":0.6643000245094299},{"id":"https://openalex.org/keywords/euclidean-distance-matrix","display_name":"Euclidean distance matrix","score":0.5034000277519226},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5033000111579895},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.444599986076355},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4318000078201294},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.4293999969959259},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4065000116825104},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4025999903678894},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.39320001006126404}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.803600013256073},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6643000245094299},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5307000279426575},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.515999972820282},{"id":"https://openalex.org/C171558263","wikidata":"https://www.wikidata.org/wiki/Q5406122","display_name":"Euclidean distance matrix","level":3,"score":0.5034000277519226},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5033000111579895},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.444599986076355},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4318000078201294},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.4293999969959259},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4065000116825104},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4025999903678894},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.39320001006126404},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.3695000112056732},{"id":"https://openalex.org/C23719512","wikidata":"https://www.wikidata.org/wiki/Q867345","display_name":"Euclidean domain","level":4,"score":0.36660000681877136},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.3564000129699707},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3540000021457672},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.34850001335144043},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3467999994754791},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3400999903678894},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.3278999924659729},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29510000348091125},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C98371066","wikidata":"https://www.wikidata.org/wiki/Q230848","display_name":"Euclidean algorithm","level":2,"score":0.28600001335144043},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.27630001306533813},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.27379998564720154},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.2702000141143799},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2612000107765198},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2606000006198883},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.2547999918460846}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.28265","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.28265","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":"doi:10.48550/arxiv.2603.28265","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.28265","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":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,39,163],"the":[1,15,27,61,75,83,113,118,125,140,166,177,222,236],"(continuous)":[2],"Euclidean":[3,29,76,141,178],"$k$-center":[4,77],"problem,":[5],"given":[6],"$n$":[7],"points":[8,22],"in":[9,23,50,53,106,144,181],"$\\mathbb{R}^d$":[10,24],"and":[11,87,156,221,233],"an":[12,148],"integer":[13],"$k$,":[14],"goal":[16],"is":[17,70,93,135,195,230],"to":[18,35,215],"find":[19],"$k$":[20],"center":[21],"that":[25,68,82,130,171,226],"minimize":[26],"maximum":[28],"distance":[30],"from":[31],"any":[32,102,132,173],"input":[33],"point":[34,209],"its":[36],"closest":[37],"center.":[38],"this":[40,48],"paper,":[41],"we":[42,66,128,169],"establish":[43],"conditional":[44],"lower":[45,98],"bounds":[46],"for":[47,74,131,139,172],"problem":[49,143,180],"constant":[51],"dimensions":[52],"two":[54],"settings.":[55],"$\\bullet$":[56,121],"Parameterized":[57],"by":[58,117,152],"$k$:":[59,123],"Assuming":[60,124],"Exponential":[62],"Time":[63],"Hypothesis":[64],"(ETH),":[65],"show":[67],"there":[69,134],"no":[71,136,185],"$f(k)n^{o(k^{1-1/d})}$-time":[72],"algorithm":[73,84,104,138],"problem.":[78],"This":[79,146],"result":[80],"shows":[81],"of":[85,112,191,200,203,219],"Agarwal":[86],"Procopiuc":[88],"[SODA":[89],"1998;":[90],"Algorithmica":[91],"2002]":[92],"essentially":[94],"optimal.":[95],"Furthermore,":[96],"our":[97,193],"bound":[99],"rules":[100],"out":[101],"$(1+\\varepsilon)$-approximation":[103],"running":[105],"time":[107],"$(k/\\varepsilon)^{o(k^{1-1/d})}n^{O(1)}$,":[108],"thereby":[109],"establishing":[110],"near-optimality":[111],"corresponding":[114],"approximation":[115],"scheme":[116],"same":[119,167],"authors.":[120],"Small":[122],"3-SUM":[126],"hypothesis,":[127,168],"prove":[129,170],"$\\varepsilon>0$":[133],"$O(n^{2-\\varepsilon})$-time":[137,186],"$2$-center":[142],"$\\mathbb{R}^3$.":[145],"settles":[147],"open":[149],"question":[150],"posed":[151],"Agarwal,":[153],"Ben":[154],"Avraham,":[155],"Sharir":[157],"[SoCG":[158],"2010;":[159],"Computational":[160],"Geometry":[161],"2013].":[162],"addition,":[164],"under":[165],"$\\varepsilon":[174],">":[175],"0$,":[176],"$6$-center":[179],"$\\mathbb{R}^2$":[182],"also":[183],"admits":[184],"algorithm.":[187],"The":[188],"technical":[189],"core":[190],"all":[192],"proofs":[194],"a":[196,201,208,216,227,239],"novel":[197],"geometric":[198,223],"embedding":[199],"system":[202,237],"linear":[204],"equations.":[205],"We":[206],"construct":[207],"set":[210],"where":[211],"each":[212],"variable":[213],"corresponds":[214],"specific":[217],"collection":[218],"points,":[220],"structure":[224],"ensures":[225],"small-radius":[228],"clustering":[229],"possible":[231],"if":[232,235],"only":[234],"has":[238],"valid":[240],"solution.":[241]},"counts_by_year":[],"updated_date":"2026-04-02T13:53:19.096889","created_date":"2026-04-02T00:00:00"}