{"id":"https://openalex.org/W1975461956","doi":"https://doi.org/10.1137/100798144","title":"On Clustering to Minimize the Sum of Radii","display_name":"On Clustering to Minimize the Sum of Radii","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W1975461956","doi":"https://doi.org/10.1137/100798144","mag":"1975461956"},"language":"en","primary_location":{"id":"doi:10.1137/100798144","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100798144","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049458753","display_name":"Matt Gibson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Matt Gibson","raw_affiliation_strings":["matthew-gibson@uiowa.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"matthew-gibson@uiowa.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111481142","display_name":"Gaurav Kanade","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gaurav Kanade","raw_affiliation_strings":["gaurav.kanade@gmail.com and kasturi-varadarajan@uiowa.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"gaurav.kanade@gmail.com and kasturi-varadarajan@uiowa.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024865139","display_name":"Erik Krohn","orcid":"https://orcid.org/0000-0002-5832-8135"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Erik Krohn","raw_affiliation_strings":["krohne@uwosh.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"krohne@uwosh.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011383804","display_name":"Imran A. Pirwani","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Imran A. Pirwani","raw_affiliation_strings":["imran.pirwani@gmail.com#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"imran.pirwani@gmail.com#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113712448","display_name":"Kasturi Varadarajan","orcid":null},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kasturi Varadarajan","raw_affiliation_strings":["University of Iowa, "],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Iowa, ","institution_ids":["https://openalex.org/I126307644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.5431,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.91804362,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"41","issue":"1","first_page":"47","last_page":"60"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998999834060669,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9994000196456909,"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/T11106","display_name":"Data Management and Algorithms","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.6813218593597412},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6766217947006226},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6586353778839111},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6550365090370178},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5925293564796448},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.528235137462616},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5269131064414978},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.510429322719574},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4895852506160736},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.46945852041244507},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.44417884945869446},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40407681465148926},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33315885066986084},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21485885977745056},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1118190586566925},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09388619661331177},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07053032517433167}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6813218593597412},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6766217947006226},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6586353778839111},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6550365090370178},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5925293564796448},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.528235137462616},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5269131064414978},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.510429322719574},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4895852506160736},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.46945852041244507},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.44417884945869446},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40407681465148926},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33315885066986084},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21485885977745056},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1118190586566925},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09388619661331177},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07053032517433167},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/100798144","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100798144","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1974383230","https://openalex.org/W1994248285","https://openalex.org/W2007052372","https://openalex.org/W2012326410","https://openalex.org/W4210565129","https://openalex.org/W4255110400"],"related_works":["https://openalex.org/W1759995226","https://openalex.org/W2962917430","https://openalex.org/W2040347389","https://openalex.org/W4299305030","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W4299801389","https://openalex.org/W2089134982","https://openalex.org/W2028468530","https://openalex.org/W1903284337"],"abstract_inverted_index":{"Let":[0],"P":[1,28],"be":[2,63],"a":[3,21,70],"set":[4],"of":[5,14,32,36,39],"n":[6],"points":[7],"in":[8,23,69],"the":[9,12,30,34,37,40,56],"plane.":[10],"Consider":[11],"problem":[13,50],"finding":[15],"k":[16],"disks,":[17],"each":[18],"centered":[19],"at":[20],"point":[22],"P,":[24],"whose":[25],"union":[26],"covers":[27],"with":[29,51],"objective":[31],"minimizing":[33],"sum":[35],"radii":[38],"disks.":[41],"We":[42],"present":[43],"an":[44],"exact":[45],"algorithm":[46,67],"for":[47],"this":[48],"well-studied":[49],"polynomial":[52],"running":[53],"time,":[54],"under":[55],"assumption":[57],"that":[58],"two":[59],"candidate":[60],"solutions":[61],"can":[62],"compared":[64],"efficiently.":[65],"The":[66],"generalizes":[68],"straightforward":[71],"manner":[72],"to":[73,78],"any":[74],"fixed":[75],"dimension":[76],"and":[77],"some":[79],"other":[80],"related":[81],"problems.":[82]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}