{"id":"https://openalex.org/W2522951985","doi":"https://doi.org/10.1145/2907050","title":"Inapproximability of the Multilevel Uncapacitated Facility Location Problem","display_name":"Inapproximability of the Multilevel Uncapacitated Facility Location Problem","publication_year":2016,"publication_date":"2016-09-21","ids":{"openalex":"https://openalex.org/W2522951985","doi":"https://doi.org/10.1145/2907050","mag":"2522951985"},"language":"en","primary_location":{"id":"doi:10.1145/2907050","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2907050","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/A5060555975","display_name":"Ravishankar Krishnaswamy","orcid":"https://orcid.org/0000-0002-5765-0843"},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Ravishankar Krishnaswamy","raw_affiliation_strings":["Microsoft Research India, Bangalore, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research India, Bangalore, India","institution_ids":["https://openalex.org/I4210124949"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111449864","display_name":"Maxim Sviridenko","orcid":null},"institutions":[{"id":"https://openalex.org/I4210134091","display_name":"Yahoo (United States)","ror":"https://ror.org/040dkzz12","country_code":"US","type":"company","lineage":["https://openalex.org/I4210134091"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Maxim Sviridenko","raw_affiliation_strings":["Yahoo Labs, NYC, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yahoo Labs, NYC, NY, USA","institution_ids":["https://openalex.org/I4210134091"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.6082,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.90799346,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"13","issue":"1","first_page":"1","last_page":"25"},"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.9984999895095825,"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.9984999895095825,"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.9811000227928162,"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/T12288","display_name":"Optimization and Search Problems","score":0.9754999876022339,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.8604885935783386},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6480812430381775},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5793518424034119},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5552576780319214},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5530090928077698},{"id":"https://openalex.org/keywords/1-center-problem","display_name":"1-center problem","score":0.4457533657550812},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43633657693862915},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42572879791259766},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4137771725654602},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4131155014038086},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3345021605491638},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3300575613975525},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32487452030181885}],"concepts":[{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.8604885935783386},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6480812430381775},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5793518424034119},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5552576780319214},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5530090928077698},{"id":"https://openalex.org/C50524431","wikidata":"https://www.wikidata.org/wiki/Q4545814","display_name":"1-center problem","level":3,"score":0.4457533657550812},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43633657693862915},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42572879791259766},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4137771725654602},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4131155014038086},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3345021605491638},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3300575613975525},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32487452030181885},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2907050","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2907050","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.231.5731","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.231.5731","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://siam.omnibooksonline.com/2012SODA/data/papers/284.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.296.2887","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.296.2887","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www2.warwick.ac.uk/fac/sci/dcs/people/maxim_sviridenko/LastVersion2013.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W113414296","https://openalex.org/W1482186473","https://openalex.org/W1520007244","https://openalex.org/W1586797185","https://openalex.org/W1611586598","https://openalex.org/W1696776098","https://openalex.org/W1972454391","https://openalex.org/W1978117135","https://openalex.org/W1987503114","https://openalex.org/W2021745860","https://openalex.org/W2033647570","https://openalex.org/W2040924621","https://openalex.org/W2045045217","https://openalex.org/W2052494364","https://openalex.org/W2053751186","https://openalex.org/W2057402832","https://openalex.org/W2061594253","https://openalex.org/W2068024426","https://openalex.org/W2074682523","https://openalex.org/W2076746184","https://openalex.org/W2088659184","https://openalex.org/W2109353682","https://openalex.org/W2143996311","https://openalex.org/W2157054705","https://openalex.org/W2163196406","https://openalex.org/W2163322487","https://openalex.org/W2177090493","https://openalex.org/W2621840633","https://openalex.org/W2769481137","https://openalex.org/W2906874184","https://openalex.org/W3136436047","https://openalex.org/W4241216116","https://openalex.org/W4243637616","https://openalex.org/W4254220436","https://openalex.org/W4389615669"],"related_works":["https://openalex.org/W2246386411","https://openalex.org/W276709744","https://openalex.org/W2962917430","https://openalex.org/W2963809215","https://openalex.org/W2173317315","https://openalex.org/W2074682523","https://openalex.org/W1984819898","https://openalex.org/W2006514056","https://openalex.org/W4248426730","https://openalex.org/W2171134634"],"abstract_inverted_index":{"In":[0,16],"this":[1,118],"article,":[2],"we":[3,18,54],"present":[4],"improved":[5],"inapproximability":[6,101,113],"results":[7,64],"for":[8,38,89,107,117,139],"the":[9,39,46,67,74,85,90,108,126,140],"k":[10,42,50,81,143],"-level":[11],"uncapacitated":[12,76],"facility":[13,77,122],"location":[14,78,123],"problem.":[15,110],"particular,":[17],"show":[19,65],"that":[20,66],"there":[21],"is":[22,70,93,102,125],"no":[23],"polynomial":[24],"time":[25],"approximation":[26,87],"algorithm":[27],"with":[28],"performance":[29],"guarantee":[30,88],"better":[31,57],"than":[32,73],"1.539":[33,106],"unless":[34],"P":[35],"=":[36,43,82,144],"NP":[37],"case":[40,47,141],"when":[41],"2.":[44],"For":[45],"of":[48,60,105,120,128,142],"general":[49],"(tending":[51],"to":[52,96,131],"infinity),":[53],"obtain":[55],"a":[56,103],"hardness":[58],"factor":[59,104],"1.61.":[61],"Interestingly,":[62],"our":[63,100],"two-level":[68,109],"problem":[69,79,92],"computationally":[71],"harder":[72],"well-known":[75],"(":[80],"1)":[83],"since":[84],"best-known":[86],"latter":[91],"1.488":[94],"due":[95,130],"Li":[97],"[2013],":[98],"and":[99,133],"The":[111],"only":[112],"result":[114],"known":[115],"before":[116],"class":[119],"metric":[121],"problems":[124],"bound":[127],"1.463":[129],"Guha":[132],"Khuller":[134],"[1999],":[135],"which":[136],"holds":[137],"even":[138],"1.":[145]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}