{"id":"https://openalex.org/W2005694048","doi":"https://doi.org/10.1109/focs.2012.63","title":"LP Rounding for k-Centers with Non-uniform Hard Capacities","display_name":"LP Rounding for k-Centers with Non-uniform Hard Capacities","alternate_titles":[],"publication_year":2012,"publication_date":"2012-10-01","ids":{"openalex":"https://openalex.org/W2005694048","doi":"https://doi.org/10.1109/focs.2012.63","mag":"2005694048"},"language":"en","primary_location":{"id":"doi:10.1109/focs.2012.63","doi":"https://doi.org/10.1109/focs.2012.63","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2012.63","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 53rd Annual Symposium on Foundations of Computer Science","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2005694048"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5037989463","display_name":"Marek Cygan","orcid":"https://orcid.org/0000-0003-2472-2975","observed_orcids":["https://orcid.org/0000-0003-2472-2975"]},"institutions":[{"id":"https://openalex.org/I2614128279","display_name":"Dalle Molle Institute for Artificial Intelligence Research","ror":"https://ror.org/013355g38","country_code":"CH","type":"facility","lineage":["https://openalex.org/I15196421","https://openalex.org/I2614128279","https://openalex.org/I57201433"]},{"id":"https://openalex.org/I57201433","display_name":"Universit\u00e0 della Svizzera italiana","ror":"https://ror.org/03c4atk17","country_code":"CH","type":"education","lineage":["https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Marek Cygan","raw_affiliation_strings":["IDSIA, University of Lugano, Switzerland","IDSIA, University of Lugano, Lugano, Switzerland#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IDSIA, University of Lugano, Switzerland","institution_ids":["https://openalex.org/I2614128279","https://openalex.org/I57201433"]},{"raw_affiliation_string":"IDSIA, University of Lugano, Lugano, Switzerland#TAB#","institution_ids":["https://openalex.org/I2614128279","https://openalex.org/I57201433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111876448","display_name":"MohammadTaghi Hajiaghayi","orcid":"https://orcid.org/0000-0003-4842-0533","observed_orcids":["https://orcid.org/0000-0003-4842-0533"]},"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":"MohammadTaghi Hajiaghayi","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College Park, USA","Dept. of Comput. Sci., Univ. of Maryland, College Park, MD, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Univ. of Maryland, College Park, MD, USA#TAB#","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042716179","display_name":"Samir Khuller","orcid":"https://orcid.org/0000-0002-5408-8023","observed_orcids":["https://orcid.org/0000-0002-5408-8023"]},"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":"Samir Khuller","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College Park, USA","Dept. of Comput. Sci., Univ. of Maryland, College Park, MD, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Univ. of Maryland, College Park, MD, USA#TAB#","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.1897,"has_fulltext":false,"cited_by_count":90,"citation_normalized_percentile":{"value":0.92467407,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"273","last_page":"282"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9829000234603882,"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.9829000234603882,"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.00570000009611249,"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.0026000000070780516,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/k-center-problem","display_name":"k-center problem","score":0.8709999918937683},{"id":"https://openalex.org/keywords/lp-rounding","display_name":"LP rounding","score":0.8799999952316284},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.9570000171661377},{"id":"https://openalex.org/keywords/constant-factor-approximation","display_name":"constant-factor approximation","score":0.6899999976158142},{"id":"https://openalex.org/keywords/facility-location","display_name":"facility location","score":0.7720000147819519}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.8192989826202393},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7551319599151611},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6641985774040222},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.6339864730834961},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5775551795959473},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5086773037910461},{"id":"https://openalex.org/C2779463800","wikidata":"https://www.wikidata.org/wiki/Q5062222","display_name":"Center (category theory)","level":2,"score":0.48364531993865967},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46039456129074097},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.45548927783966064},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4359113872051239},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.42229267954826355},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41452154517173767},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34204769134521484},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34165096282958984},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/focs.2012.63","doi":"https://doi.org/10.1109/focs.2012.63","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2012.63","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 53rd Annual Symposium on Foundations of Computer Science","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W181296567","https://openalex.org/W1508746608","https://openalex.org/W1559577696","https://openalex.org/W1966016308","https://openalex.org/W1966395945","https://openalex.org/W1971680805","https://openalex.org/W1973264045","https://openalex.org/W1983197449","https://openalex.org/W1994698869","https://openalex.org/W2007604989","https://openalex.org/W2007902568","https://openalex.org/W2010410498","https://openalex.org/W2028549267","https://openalex.org/W2029933769","https://openalex.org/W2044028871","https://openalex.org/W2051169745","https://openalex.org/W2055996587","https://openalex.org/W2073583237","https://openalex.org/W2074048915","https://openalex.org/W2085751730","https://openalex.org/W2089074354","https://openalex.org/W2106850014","https://openalex.org/W2108073487","https://openalex.org/W2109549136","https://openalex.org/W2139841919","https://openalex.org/W2144926522","https://openalex.org/W2147670675","https://openalex.org/W2149106399","https://openalex.org/W2157089136","https://openalex.org/W2177090493","https://openalex.org/W2317079499","https://openalex.org/W2574266776","https://openalex.org/W2608158342","https://openalex.org/W3148765228","https://openalex.org/W4232384064","https://openalex.org/W4243637616","https://openalex.org/W6630328157","https://openalex.org/W6676412623"],"related_works":["https://openalex.org/W7099903219","https://openalex.org/W2950629493","https://openalex.org/W1627051156","https://openalex.org/W4300746587","https://openalex.org/W2792638073","https://openalex.org/W1504294538","https://openalex.org/W2577136449","https://openalex.org/W2963517083","https://openalex.org/W2114589083","https://openalex.org/W4415517278"],"abstract_inverted_index":{"In":[0],"this":[1,109,137,148],"paper":[2],"we":[3,34,199,207],"consider":[4],"a":[5,22,29,49,87,124,163,179,188,201],"generalization":[6],"of":[7,108,155,162,185,187],"the":[8,36,46,99,120,130,153,174,183],"classical":[9],"k-center":[10],"problem":[11,61,110],"with":[12,92],"capacities.":[13],"Our":[14,139],"goal":[15],"is":[16,43,62,90,178],"to":[17,28,44,52,54,56,146,173,219],"select":[18],"k":[19],"centers":[20,66,83],"in":[21],"graph,":[23],"and":[24,71,106,150,169],"assign":[25],"each":[26],"node":[27,50,164,189],"nearby":[30],"center,":[31],"so":[32],"that":[33,190,213],"respect":[35],"capacity":[37,69,101,126],"constraints":[38],"on":[39,119,182],"centers.":[40],"The":[41],"objective":[42],"minimize":[45],"maximum":[47],"distance":[48],"has":[51],"travel":[53],"get":[55],"its":[57],"assigned":[58],"center.":[59],"This":[60],"NP-hard,":[63],"even":[64],"when":[65,81,159,176],"have":[67,84,111],"no":[68,93,115],"restrictions":[70],"optimal":[72],"factor":[73,133],"2":[74],"approximation":[75,89,134],"algorithms":[76],"are":[77,216],"known.":[78],"With":[79],"capacities,":[80,86,158],"all":[82],"identical":[85],"6":[88],"known":[91],"better":[94],"lower":[95],"bounds":[96],"than":[97],"for":[98,123,136,152,195],"infinite":[100],"version.":[102],"While":[103],"many":[104],"generalizations":[105],"variations":[107],"been":[112],"studied":[113],"extensively,":[114],"progress":[116],"was":[117],"made":[118],"capacitated":[121],"version":[122],"general":[125],"function.":[127],"We":[128],"develop":[129],"first":[131],"constant":[132],"algorithm":[135,140],"problem.":[138],"uses":[141],"an":[142],"LP":[143],"rounding":[144],"approach":[145],"solve":[147],"problem,":[149],"works":[151],"case":[154,175],"non-uniform":[156,196],"hard":[157,180,214],"multiple":[160],"copies":[161,186],"may":[165,191],"not":[166],"be":[167,171,192],"chosen":[168],"can":[170],"extended":[172],"there":[177],"bound":[181],"number":[184],"selected.":[193],"Finally,":[194],"soft":[197],"capacities":[198,215],"present":[200],"much":[202,217],"simpler":[203],"11-approximation":[204],"algorithm,":[205],"which":[206],"find":[208],"as":[209],"one":[210],"more":[211],"evidence":[212],"harder":[218],"deal":[220],"with.":[221]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2005694048","counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":5}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
