{"id":"https://openalex.org/W3162678658","doi":"https://doi.org/10.1145/2981561","title":"An Improved Approximation for <i>k</i> -Median and Positive Correlation in Budgeted Optimization","display_name":"An Improved Approximation for <i>k</i> -Median and Positive Correlation in Budgeted Optimization","publication_year":2017,"publication_date":"2017-03-06","ids":{"openalex":"https://openalex.org/W3162678658","doi":"https://doi.org/10.1145/2981561","mag":"3162678658"},"language":"en","primary_location":{"id":"doi:10.1145/2981561","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2981561","pdf_url":null,"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":null,"license_id":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023591555","display_name":"Jaros\u0142aw Byrka","orcid":"https://orcid.org/0000-0002-3387-0913"},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Jaros\u0142aw Byrka","raw_affiliation_strings":["University of Wroc\u0142aw, Wroc\u0142aw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wroc\u0142aw, Wroc\u0142aw, Poland","institution_ids":["https://openalex.org/I219388962"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067838875","display_name":"Thomas Pensyl","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas Pensyl","raw_affiliation_strings":["University of Maryland, College Park, Room, MD"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, Room, MD","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000959887","display_name":"Bartosz Rybicki","orcid":null},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Bartosz Rybicki","raw_affiliation_strings":["University of Wroc\u0142aw, Wroc\u0142aw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wroc\u0142aw, Wroc\u0142aw, Poland","institution_ids":["https://openalex.org/I219388962"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005118312","display_name":"Aravind Srinivasan","orcid":"https://orcid.org/0000-0002-0062-3684"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aravind Srinivasan","raw_affiliation_strings":["University of Maryland, College Park, Room, MD"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, Room, MD","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028451175","display_name":"Khoa Trinh","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Khoa Trinh","raw_affiliation_strings":["University of Maryland, College Park, Room, MD"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, Room, MD","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5023591555"],"corresponding_institution_ids":["https://openalex.org/I219388962"],"apc_list":null,"apc_paid":null,"fwci":5.5006,"has_fulltext":false,"cited_by_count":76,"citation_normalized_percentile":{"value":0.9652718,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"13","issue":"2","first_page":"1","last_page":"31"},"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.9997000098228455,"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.9997000098228455,"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/T12288","display_name":"Optimization and Search Problems","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.995199978351593,"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/rounding","display_name":"Rounding","score":0.9777727127075195},{"id":"https://openalex.org/keywords/correlation","display_name":"Correlation","score":0.6808626651763916},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.596473753452301},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.5623217821121216},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.559380054473877},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.527520477771759},{"id":"https://openalex.org/keywords/negative-correlation","display_name":"Negative correlation","score":0.4768192172050476},{"id":"https://openalex.org/keywords/positive-correlation","display_name":"Positive correlation","score":0.4592369496822357},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44936150312423706},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4110866189002991},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32385605573654175},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.22585436701774597}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.9777727127075195},{"id":"https://openalex.org/C117220453","wikidata":"https://www.wikidata.org/wiki/Q5172842","display_name":"Correlation","level":2,"score":0.6808626651763916},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.596473753452301},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.5623217821121216},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.559380054473877},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.527520477771759},{"id":"https://openalex.org/C2988405389","wikidata":"https://www.wikidata.org/wiki/Q6987247","display_name":"Negative correlation","level":2,"score":0.4768192172050476},{"id":"https://openalex.org/C2986115478","wikidata":"https://www.wikidata.org/wiki/Q186290","display_name":"Positive correlation","level":2,"score":0.4592369496822357},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44936150312423706},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4110866189002991},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32385605573654175},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.22585436701774597},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","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/C126322002","wikidata":"https://www.wikidata.org/wiki/Q11180","display_name":"Internal medicine","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2981561","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2981561","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3541380492","display_name":null,"funder_award_id":"CNS 1010789 and CCF 1422569","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8280601088","display_name":null,"funder_award_id":"NCN 2015/18/E/ST6/00456 and NCN 2012/07/N/ST6/03068","funder_id":"https://openalex.org/F4320322650","funder_display_name":"Narodowym Centrum Nauki"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320322650","display_name":"Narodowym Centrum Nauki","ror":"https://ror.org/03ha2q922"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1927951443","https://openalex.org/W1982618872","https://openalex.org/W2003207175","https://openalex.org/W2004660767","https://openalex.org/W2006514056","https://openalex.org/W2007604989","https://openalex.org/W2019807548","https://openalex.org/W2023770210","https://openalex.org/W2024112283","https://openalex.org/W2028549267","https://openalex.org/W2029933769","https://openalex.org/W2040155008","https://openalex.org/W2041493762","https://openalex.org/W2052494364","https://openalex.org/W2072291569","https://openalex.org/W2079669094","https://openalex.org/W2080379754","https://openalex.org/W2081185834","https://openalex.org/W2112112676","https://openalex.org/W2132651631","https://openalex.org/W2139841919","https://openalex.org/W2165420145","https://openalex.org/W2285940496","https://openalex.org/W2792638073"],"related_works":["https://openalex.org/W1581948717","https://openalex.org/W1941111399","https://openalex.org/W2268207117","https://openalex.org/W4313357160","https://openalex.org/W4300488607","https://openalex.org/W1916943706","https://openalex.org/W2951095575","https://openalex.org/W2105543801","https://openalex.org/W2002272911","https://openalex.org/W2561769964"],"abstract_inverted_index":{"Dependent":[0],"rounding":[1,30,54,91,128],"is":[2],"a":[3],"useful":[4],"technique":[5],"for":[6,28,77,103],"optimization":[7],"problems":[8],"with":[9],"hard":[10],"budget":[11],"constraints.":[12],"This":[13],"framework":[14],"naturally":[15,26],"leads":[16],"to":[17,84,110,149],"negative":[18],"correlation":[19,38,87],"properties.":[20],"However,":[21],"what":[22],"if":[23],"an":[24,116],"application":[25],"calls":[27],"dependent":[29,53,90,127],"on":[31,39,138],"the":[32,40,49,68,78,133,136,139],"one":[33],"hand":[34],"and":[35,75,93],"desires":[36],"positive":[37,63,86],"other?":[41],"More":[42],"generally,":[43],"we":[44],"develop":[45],"algorithms":[46],"that":[47,118],"guarantee":[48],"known":[50],"properties":[51],"of":[52,67,73,123,135],"but":[55],"also":[56],"have":[57],"nearly":[58],"bestpossible":[59],"behavior\u2014near-independence,":[60],"which":[61],"generalizes":[62],"correlation\u2014on":[64],"\u201csmall\u201d":[65],"subsets":[66],"variables.":[69],"The":[70],"recent":[71],"breakthrough":[72],"Li":[74],"Svensson":[76],"classical":[79],"k":[80,104],"-median":[81,105],"problem":[82],"has":[83],"handle":[85],"in":[88],"certain":[89],"settings,":[92],"does":[94],"so":[95],"implicitly.":[96],"We":[97],"improve":[98,132],"upon":[99,120],"Li-Svensson\u2019s":[100,143],"approximation":[101],"ratio":[102],"from":[106,142],"2.732":[107],"+":[108,112],"\u03f5":[109,113,141],"2.675":[111],"by":[114],"developing":[115],"algorithm":[117],"improves":[119],"various":[121],"aspects":[122],"their":[124],"work.":[125],"Our":[126],"approach":[129],"helps":[130],"us":[131],"dependence":[134],"runtime":[137],"parameter":[140],"N":[144,150],"O":[145,151],"(1/\u03f5":[146],"2":[147],")":[148],"((1/\u03f5)log(1/\u03f5))":[152],".":[153]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":15},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}