{"id":"https://openalex.org/W3178347017","doi":"https://doi.org/10.1145/3572840","title":"Universal Algorithms for Clustering Problems","display_name":"Universal Algorithms for Clustering Problems","publication_year":2022,"publication_date":"2022-12-13","ids":{"openalex":"https://openalex.org/W3178347017","doi":"https://doi.org/10.1145/3572840","mag":"3178347017"},"language":"en","primary_location":{"id":"doi:10.1145/3572840","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3572840","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3572840","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3572840","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089993465","display_name":"Arun Ganesh","orcid":"https://orcid.org/0000-0001-6057-7619"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Arun Ganesh","raw_affiliation_strings":["UC Berkeley, Berkeley, California, USA"],"raw_orcid":"https://orcid.org/0000-0001-6057-7619","affiliations":[{"raw_affiliation_string":"UC Berkeley, Berkeley, California, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046808993","display_name":"Bruce M. Maggs","orcid":"https://orcid.org/0000-0002-5692-7062"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bruce M. Maggs","raw_affiliation_strings":["Duke University and Emerald Innovations, Durham, North Carolina, USA"],"raw_orcid":"https://orcid.org/0000-0002-5692-7062","affiliations":[{"raw_affiliation_string":"Duke University and Emerald Innovations, Durham, North Carolina, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087182068","display_name":"Debmalya Panigrahi","orcid":"https://orcid.org/0000-0003-1799-6660"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Debmalya Panigrahi","raw_affiliation_strings":["Duke University, Durham, North Carolina, USA"],"raw_orcid":"https://orcid.org/0000-0003-1799-6660","affiliations":[{"raw_affiliation_string":"Duke University, Durham, North Carolina, USA","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089993465"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":0.8907,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.76686686,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"19","issue":"2","first_page":"1","last_page":"46"},"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.9987999796867371,"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.9987999796867371,"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.9891999959945679,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9745000004768372,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7657682299613953},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5992886424064636},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.5162684917449951},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5068839192390442},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5015974044799805},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4868830740451813},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.45578545331954956},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4493626654148102},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.4416438639163971},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.41522324085235596},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37704193592071533},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36676228046417236},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3638631999492645},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3546299338340759},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08423489332199097}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7657682299613953},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5992886424064636},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.5162684917449951},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5068839192390442},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5015974044799805},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4868830740451813},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.45578545331954956},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4493626654148102},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.4416438639163971},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.41522324085235596},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37704193592071533},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36676228046417236},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3638631999492645},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3546299338340759},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08423489332199097},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3572840","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3572840","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3572840","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3572840","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3572840","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3572840","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1082722339","display_name":null,"funder_award_id":"CCF-1750140","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2954400926","display_name":null,"funder_award_id":"CCF-1535989","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3975607665","display_name":"Collaborative Research: AF: Medium: Algorithms Meet Machine Learning: Mitigating Uncertainty in Optimization","funder_award_id":"1955703","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5226018963","display_name":"CAREER: New Directions in Graph Algorithms","funder_award_id":"1750140","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5857933033","display_name":"AitF: FULL: Collaborative Research: Optimizing Networked Systems with Limited Information","funder_award_id":"1535972","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"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/G7019761770","display_name":null,"funder_award_id":"1535989","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7291707221","display_name":null,"funder_award_id":"CCF-1535972","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3178347017.pdf","grobid_xml":"https://content.openalex.org/works/W3178347017.grobid-xml"},"referenced_works_count":55,"referenced_works":["https://openalex.org/W128170130","https://openalex.org/W1484951415","https://openalex.org/W1496498429","https://openalex.org/W1516429886","https://openalex.org/W1526404960","https://openalex.org/W1529111168","https://openalex.org/W1531368347","https://openalex.org/W1546634629","https://openalex.org/W1573215270","https://openalex.org/W1604332079","https://openalex.org/W1680189815","https://openalex.org/W1846028264","https://openalex.org/W1966612958","https://openalex.org/W1973264045","https://openalex.org/W1975162826","https://openalex.org/W1976584101","https://openalex.org/W1977541023","https://openalex.org/W1981673685","https://openalex.org/W1982280823","https://openalex.org/W1988146710","https://openalex.org/W1995718774","https://openalex.org/W1996509676","https://openalex.org/W2008959214","https://openalex.org/W2010410498","https://openalex.org/W2012329067","https://openalex.org/W2018274124","https://openalex.org/W2019819077","https://openalex.org/W2023770210","https://openalex.org/W2037698052","https://openalex.org/W2043459466","https://openalex.org/W2043644965","https://openalex.org/W2044028871","https://openalex.org/W2055996587","https://openalex.org/W2057974767","https://openalex.org/W2068317683","https://openalex.org/W2070352298","https://openalex.org/W2073583237","https://openalex.org/W2076901012","https://openalex.org/W2104116126","https://openalex.org/W2110105238","https://openalex.org/W2110655989","https://openalex.org/W2129089467","https://openalex.org/W2132651631","https://openalex.org/W2134396776","https://openalex.org/W2134746140","https://openalex.org/W2139841919","https://openalex.org/W2149547375","https://openalex.org/W2150217455","https://openalex.org/W2150593711","https://openalex.org/W2165420145","https://openalex.org/W2199495299","https://openalex.org/W2487535666","https://openalex.org/W2565644440","https://openalex.org/W2963120985","https://openalex.org/W4245266864"],"related_works":["https://openalex.org/W2971351794","https://openalex.org/W4376155396","https://openalex.org/W1947085858","https://openalex.org/W2101991911","https://openalex.org/W2174986909","https://openalex.org/W2527791220","https://openalex.org/W2155070487","https://openalex.org/W4311589891","https://openalex.org/W3123835761","https://openalex.org/W118270247"],"abstract_inverted_index":{"This":[0,249],"article":[1],"presents":[2],"universal":[3,84,159,190,268],"algorithms":[4,160,191],"for":[5,45,56,88,101,140,161,189,239,267],"clustering":[6,90,164],"problems,":[7],"including":[8],"the":[9,62,68,71,74,134,137,148,162,206,212,240,261],"widely":[10,241],"studied":[11,242],"k":[12,14,17,35,167,169,172],"-median,":[13,168],"-means,":[15,170],"and":[16,77,145,171,205],"-center":[18,173],"objectives.":[19],"The":[20,31],"input":[21],"is":[22,92,133,147,226,232,260],"a":[23,42,89,186,235],"metric":[24,247],"space":[25],"containing":[26],"all":[27,65,102],"potential":[28],"client":[29],"locations.":[30],"algorithm":[32],"must":[33],"select":[34],"cluster":[36],"centers":[37],"such":[38],"that":[39,50,78,174,223,251],"they":[40],"are":[41,158,183,214],"good":[43],"solution":[44,76,86,139],"any":[46,153],"subset":[47,210],"of":[48,67,73,79,104,136,166,211,245,264],"clients":[49,105,141,213],"actually":[51],"realize.":[52],"Specifically,":[53],"we":[54],"aim":[55],"low":[57],"regret":[58,150],",":[59,98,108,127],"defined":[60],"as":[61],"maximum":[63],"over":[64],"subsets":[66,103],"difference":[69],"between":[70],"cost":[72,135],"algorithm\u2019s":[75,85],"an":[80,96],"optimal":[81,138],"solution.":[82,154],"A":[83],"Sol":[87],"problem":[91],"said":[93],"to":[94,200],"be":[95],"\u03b1":[97,117,229],"\u03b2-approximation":[99],"if":[100,228],"C":[106,113,121,131,143],"\u2032":[107,114,132],"it":[109],"satisfies":[110],"sol":[111],"(":[112,120,130,142,176,255],")":[115],"\u2264":[116],"\u010b":[118,125],"opt":[119,129],"\u2032)":[122,144],"+":[123],"\u03b2":[124,231],"mr":[126,146],"where":[128,208],"minimum":[149],"achievable":[151],"by":[152],"Our":[155],"main":[156],"results":[157,182,198,221],"standard":[163],"objectives":[165],"achieve":[175],"O":[177,179,256,258],"(1),":[178,257],"(1))-approximations.":[180],"These":[181,197],"obtained":[184],"via":[185],"novel":[187],"framework":[188],"using":[192],"linear":[193],"programming":[194],"(LP)":[195],"relaxations.":[196],"generalize":[199],"other":[201],"\u2113":[202],"p":[203],"-objectives":[204],"setting":[207],"some":[209,253],"fixed":[215],".":[216],"We":[217],"also":[218],"give":[219],"hardness":[220],"showing":[222],"(\u03b1,":[224],"\u03b2)-approximation":[225],"NP-hard":[227],"or":[230],"at":[233],"most":[234],"certain":[236],"constant,":[237],"even":[238],"special":[243],"case":[244],"Euclidean":[246],"spaces.":[248],"shows":[250],"in":[252],"sense,":[254],"(1))-approximation":[259],"strongest":[262],"type":[263],"guarantee":[265],"obtainable":[266],"clustering.":[269]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}