{"id":"https://openalex.org/W7160926427","doi":"https://doi.org/10.48550/arxiv.2605.10895","title":"FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering","display_name":"FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering","publication_year":2026,"publication_date":"2026-05-11","ids":{"openalex":"https://openalex.org/W7160926427","doi":"https://doi.org/10.48550/arxiv.2605.10895"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.10895","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.10895","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.10895","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034276567","display_name":"Fabrizio Grandoni","orcid":"https://orcid.org/0000-0002-9676-4931"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Grandoni, Fabrizio","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135986147","display_name":"Anupam Gupta","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gupta, Anupam","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5102714125","display_name":"Jatin Yadav","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yadav, Jatin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"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.5285999774932861,"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.5285999774932861,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3091000020503998,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.06560000032186508,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6801000237464905},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5843999981880188},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5594000220298767},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4921000003814697},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48429998755455017},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4668000042438507},{"id":"https://openalex.org/keywords/approximation-theory","display_name":"Approximation theory","score":0.43849998712539673},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.41679999232292175}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6801000237464905},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6718000173568726},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5843999981880188},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5594000220298767},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4921000003814697},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48429998755455017},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4668000042438507},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.43849998712539673},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4260999858379364},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.41679999232292175},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.38749998807907104},{"id":"https://openalex.org/C117148685","wikidata":"https://www.wikidata.org/wiki/Q6865376","display_name":"Minimax approximation algorithm","level":2,"score":0.36390000581741333},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.3619000017642975},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34950000047683716},{"id":"https://openalex.org/C193386753","wikidata":"https://www.wikidata.org/wiki/Q1130396","display_name":"Approximations of \u03c0","level":2,"score":0.3278000056743622},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.32120001316070557},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3158999979496002},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.3140999972820282},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30489999055862427},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.3001999855041504},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2743000090122223},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.27300000190734863},{"id":"https://openalex.org/C2986878899","wikidata":"https://www.wikidata.org/wiki/Q11216","display_name":"Numerical approximation","level":3,"score":0.27149999141693115},{"id":"https://openalex.org/C160824197","wikidata":"https://www.wikidata.org/wiki/Q2071054","display_name":"Linear approximation","level":3,"score":0.2547000050544739},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2515999972820282}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.10895","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.10895","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.10895","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.10895","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"},"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],"the":[1,41,44,60,63,78],"classical":[2],"Min-Sum":[3,50],"Radii":[4],"problem":[5,52],"(MSR)":[6],"we":[7,65,72,85],"are":[8],"given":[9,83],"a":[10,17,21],"set":[11],"$X$":[12,31],"of":[13,43,46,59,62],"$n$":[14],"points":[15],"in":[16,96],"metric":[18],"space":[19],"and":[20,94,99,116,119],"positive":[22],"integer":[23],"$k\\in":[24],"[n]$.":[25],"Our":[26],"goal":[27],"is":[28,54],"to":[29,39,88],"partition":[30],"into":[32],"$k$":[33],"subsets":[34],"(the":[35],"clusters)":[36],"so":[37],"as":[38],"minimize":[40],"sum":[42],"radii":[45,61],"these":[47,110,127],"clusters.":[48],"The":[49,103],"Diameters":[51],"(MSD)":[53],"defined":[55],"analogously,":[56],"where":[57],"instead":[58],"clusters":[64],"consider":[66],"their":[67],"diameters.":[68],"For":[69],"both":[70,92,126],"problems":[71,111,128],"present":[73],"FPT":[74,106,122],"approximation":[75,107,113,123],"schemes":[76],"for":[77,91,109,125],"natural":[79],"parameter":[80],"$k$.":[81],"Specifically,":[82],"$\u03b5>0$,":[84],"show":[86],"how":[87],"compute":[89],"$(1+\u03b5)$-approximations":[90],"MSD":[93],"MSR":[95],"time":[97],"$(1/\u03b5)^kn^{O(1)}$":[98],"$(1/\u03b5)^{O(k/\u03b5\\log":[100],"1/\u03b5)}n^{poly(1/\u03b5)}$":[101],"respectively.":[102],"previous":[104],"best":[105],"algorithms":[108],"have":[112],"factors":[114],"$4+\u03b5$":[115],"$2+\u03b5$,":[117],"respectively,":[118],"finding":[120],"an":[121],"scheme":[124],"had":[129],"been":[130],"outstanding":[131],"open":[132],"problems.":[133]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2026-05-13T00:00:00"}