{"id":"https://openalex.org/W7163942654","doi":"https://doi.org/10.4230/lipics.swat.2026.26","title":"On the Parameterized Complexity of Min-Sum-Radii","display_name":"On the Parameterized Complexity of Min-Sum-Radii","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7163942654","doi":"https://doi.org/10.4230/lipics.swat.2026.26"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26062","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.26","pdf_url":null,"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":"publishedVersion","is_accepted":true,"is_published":true,"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/entities/document/10.4230/LIPIcs.SWAT.2026.26","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138139480","display_name":"Pankaj Kumar","orcid":"https://orcid.org/0009-0003-7701-2149"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Kumar, Pankaj","raw_affiliation_strings":["University of Birmingham, UK"],"raw_orcid":"https://orcid.org/0009-0003-7701-2149","affiliations":[{"raw_affiliation_string":"University of Birmingham, UK","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069794832","display_name":"Haiko M\u00fcller","orcid":"https://orcid.org/0000-0002-1123-1774"},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"M\u00fcller, Haiko","raw_affiliation_strings":["University of Leeds, UK"],"raw_orcid":"https://orcid.org/0000-0002-1123-1774","affiliations":[{"raw_affiliation_string":"University of Leeds, UK","institution_ids":["https://openalex.org/I130828816"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138196287","display_name":"Sebastian Ordyniak","orcid":"https://orcid.org/0000-0003-1935-651X"},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Ordyniak, Sebastian","raw_affiliation_strings":["University of Leeds, UK"],"raw_orcid":"https://orcid.org/0000-0003-1935-651X","affiliations":[{"raw_affiliation_string":"University of Leeds, UK","institution_ids":["https://openalex.org/I130828816"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5136798431","display_name":"Melanie Schmidt","orcid":null},"institutions":[{"id":"https://openalex.org/I44260953","display_name":"Heinrich Heine University D\u00fcsseldorf","ror":"https://ror.org/024z2rq82","country_code":"DE","type":"education","lineage":["https://openalex.org/I44260953"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Schmidt, Melanie","raw_affiliation_strings":["Heinrich Heine University D\u00fcsseldorf, Germany"],"raw_orcid":"https://orcid.org/0000-0003-4856-3905","affiliations":[{"raw_affiliation_string":"Heinrich Heine University D\u00fcsseldorf, Germany","institution_ids":["https://openalex.org/I44260953"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.92975147,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.366100013256073,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.366100013256073,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.19920000433921814,"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.17589999735355377,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.9168999791145325},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6531999707221985},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4814999997615814},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.4456000030040741},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4235000014305115},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4000999927520752},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.36250001192092896},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.35690000653266907},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.33799999952316284}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9168999791145325},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7511000037193298},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.696399986743927},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6531999707221985},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4814999997615814},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4593000113964081},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4456000030040741},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4235000014305115},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4000999927520752},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.36250001192092896},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.35690000653266907},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.33799999952316284},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.33340001106262207},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3183000087738037},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30630001425743103},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.3059999942779541},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.3012999892234802},{"id":"https://openalex.org/C17327563","wikidata":"https://www.wikidata.org/wiki/Q1991405","display_name":"Nowhere dense set","level":3,"score":0.299699991941452},{"id":"https://openalex.org/C60933471","wikidata":"https://www.wikidata.org/wiki/Q17152964","display_name":"Metric dimension","level":5,"score":0.2865999937057495},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2680000066757202},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.2614000141620636},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.25859999656677246},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.2565000057220459},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.2565000057220459}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26062","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.26","pdf_url":null,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"pmh:oai:pure.atira.dk:openaire/f4ea5746-333e-4f93-9417-e5f0d99a87b1","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/f4ea5746-333e-4f93-9417-e5f0d99a87b1","pdf_url":"https://pure-oai.bham.ac.uk/ws/files/305636479/LIPIcs.SWAT.2026.26.pdf","source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"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":"Kumar, P, Muller, H, Ordyniak, S & Schmidt, M 2026, On the Parameterized Complexity of Min-Sum-Radii. in P Fraigniaud (ed.), 20th Scandinavian Symposium on Algorithm Theory (SWAT 2026)., 26, Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 20th Scandinavian Symposium on Algorithm Theory , Copenhagen, Denmark, 17/06/26. https://doi.org/10.4230/LIPIcs.SWAT.2026.26","raw_type":"contributionToPeriodical"},{"id":"doi:10.4230/lipics.swat.2026.26","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.swat.2026.26","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:26062","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.26","pdf_url":null,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8236353954","display_name":"Approximationsalgorithmen f\u00fcr geometrische Datenanalyse und ihre Anwendbarkeit","funder_award_id":"456558332","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,87],"the":[1,47,50,53,56,92,142,146,152,155,160,165,173,206,227,261,266,276,284,297,423,426],"Min-Sum-Radii":[2],"(MSR)":[3],"clustering":[4],"problem,":[5],"we":[6,90,264,367,372],"are":[7,418],"given":[8],"a":[9,17,31,293,349],"finite":[10],"set":[11,402],"X":[12,41],"of":[13,33,40,46,52,55,95,148,154,164,296,300,307,403,425],"n":[14],"points":[15,35],"in":[16,205,364],"metric":[18],"space.":[19],"The":[20,58,338],"objective":[21],"is":[22,42,60,130,279,340,348,362],"to":[23,44,62,197,238,273,304,391],"find":[24,392],"at":[25,30],"most":[26],"k":[27,145,394],"clusters":[28,149],"centered":[29],"subset":[32],"these":[34,290,415],"such":[36],"that":[37,128,172,212,245,275,410],"every":[38],"point":[39],"assigned":[43],"one":[45,389],"clusters,":[48],"minimizing":[49],"sum":[51],"radii":[54],"clusters.":[57],"problem":[59,175,278],"known":[61,267,323],"be":[63,195],"NP-hard":[64],"even":[65,253],"on":[66,97,132,180,216,254,356],"metrics":[67,74,98,108,116,133,181,217,357],"induced":[68,99,134,182,218,358],"by":[69,81,100,135,141,183,188,219,226,251,271,283,359,422],"weighted":[70,106,136,184,221],"planar":[71],"graphs":[72,185,223,242,318,327,361],"and":[73,113,150,190,208,243,256,322,332,375,388,396],"with":[75,302,399],"constant":[76],"doubling":[77],"dimension,":[78],"as":[79,311,313,329,412,414],"shown":[80],"Gibson":[82],"et":[83,168],"al.":[84,169],"(SWAT":[85],"2008).":[86],"this":[88,193,370],"work,":[89],"investigate":[91,159],"parameterized":[93,140,162,187,225,250,270,282,298,376,421],"complexity":[94,163,299],"MSR":[96,129,174,213,246,277,301,355,411],"undirected":[101,220,360],"graphs.":[102,259],"We":[103,126,157,200,233,407],"distinguish":[104],"between":[105],"graph":[107,115],"(with":[109],"positive":[110,262],"edge":[111],"weights)":[112],"unweighted":[114,344],"(where":[117],"all":[118],"edges":[119],"have":[120],"unit":[121],"weight).":[122],"Weighted":[123],"Graph":[124,336],"Metrics.":[125,337],"show":[127,211,244,274,409],"W[1]-hard":[131,215,248],"bipartite":[137,222,258],"graphs,":[138,345],"when":[139,186,224,249,281],"combined":[143],"parameter":[144,285],"number":[147,230],"\u0394":[151],"cost":[153],"clustering.":[156],"then":[158,234],"structural":[161,314],"problem.":[166],"Drexler":[167],"[doi:10.48550/arXiv.2310.02130]":[170],"showed":[171],"admits":[176],"an":[177,400],"XP":[178,268],"algorithm":[179,269],"treewidth,":[189,272],"asked":[191],"whether":[192,354],"can":[194],"improved":[196],"fixed-parameter":[198,419],"tractability.":[199],"first":[201],"answer":[202,369],"their":[203],"question":[204,353],"negative,":[207],"more":[209],"strongly":[210],"stays":[214],"vertex":[228,320],"cover":[229,321],"plus":[231,287],"k.":[232],"turn":[235],"our":[236],"attention":[237],"parameters":[239,308,315,324],"for":[240,316,325,343,379],"dense":[241,326],"remains":[247],"k+\u0394":[252],"cliques":[255],"complete":[257,294],"On":[260],"side,":[263],"employ":[265],"FPT":[280],"treewidth":[286],"\u0394.":[288],"Together,":[289],"results":[291,378],"provide":[292,373],"picture":[295],"respect":[303],"any":[305],"combination":[306],"k,":[309],"\u0394,":[310],"well":[312,413],"sparse":[317],"above":[319],"(such":[328],"neighborhood":[330],"diversity":[331],"modular":[333],"width).":[334],"Unweighted":[335],"story":[339],"rather":[341],"different":[342],"since":[346],"it":[347],"long":[350],"standing":[351],"open":[352],"solvable":[363],"polynomial-time.":[365],"Although":[366],"cannot":[368],"question,":[371],"classical":[374],"hardness":[377],"two":[380,416],"very":[381],"closely":[382],"related":[383],"problems,":[384],"namely":[385],"Exact-MSR":[386],"(MSR":[387,398],"wants":[390],"exactly":[393],"clusters)":[395],"Allowed-Centers-MSR":[397],"additional":[401],"allowed":[404],"cluster":[405],"centers).":[406],"also":[408],"problems":[417],"tractable":[420],"treedepth":[424],"input":[427],"graph.":[428]},"counts_by_year":[],"updated_date":"2026-06-13T07:54:00.901334","created_date":"2026-06-09T00:00:00"}