{"id":"https://openalex.org/W2574266776","doi":"https://doi.org/10.1137/070708901","title":"An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem","display_name":"An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2574266776","doi":"https://doi.org/10.1137/070708901","mag":"2574266776"},"language":"en","primary_location":{"id":"doi:10.1137/070708901","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070708901","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":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/cs/0703010","any_repository_has_fulltext":true},"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/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Jaroslaw Byrka","raw_affiliation_strings":["Centrum voor Wiskunde en Informatica, Kruislaan 413, NL-1098 SJ Amsterdam, Netherlands"],"affiliations":[{"raw_affiliation_string":"Centrum voor Wiskunde en Informatica, Kruislaan 413, NL-1098 SJ Amsterdam, Netherlands","institution_ids":["https://openalex.org/I1341640284"]}]},{"author_position":"last","author":{"id":null,"display_name":"Karen Aardal","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Karen Aardal","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023591555"],"corresponding_institution_ids":["https://openalex.org/I1341640284"],"apc_list":null,"apc_paid":null,"fwci":0.3418,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.67200562,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"39","issue":"6","first_page":"2212","last_page":"2231"},"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.9700000286102295,"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.9700000286102295,"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.9010000228881836,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.8262154459953308},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6310409307479858},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6198146939277649},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.5891114473342896},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.5373584032058716},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5220631957054138},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46226370334625244},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33980002999305725},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32757651805877686},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06944826245307922}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.8262154459953308},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6310409307479858},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6198146939277649},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.5891114473342896},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.5373584032058716},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5220631957054138},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46226370334625244},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33980002999305725},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32757651805877686},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06944826245307922},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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":13,"locations":[{"id":"doi:10.1137/070708901","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070708901","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"},{"id":"pmh:oai:arXiv.org:cs/0703010","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0703010","pdf_url":"https://arxiv.org/pdf/cs/0703010","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:cwi.nl:11721","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/11721","pdf_url":"https://ir.cwi.nl/pub/11721/11721B.pdf","source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.tue.nl:publications/aec95eb2-96a9-4d4e-90ba-0796afa422fd","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/aec95eb2-96a9-4d4e-90ba-0796afa422fd","pdf_url":"https://pure.tue.nl/ws/files/2180983/Metis210800.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Byrka, J 2007, An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. in M Charikar, K Jansen, O Reingold & J D P Rolim (eds), Proceedings of the 10th International Workshop on Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques (APPROX 2007) and of the 11th International Workshop (RANDOM 2007) 20-22 August 2007, Princeton, New Jersey, USA. Lecture Notes in Computer Science, vol. 4627, Springer, Berlin, pp. 29-43, conference; APPROX 2007 and RANDOM 2007, Princeton, New Jersey, USA; 2007-08-20; 2007-08-22, 20/08/07. https://doi.org/10.1007/978-3-540-74207","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"mag:2949839236","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/cs/0703010.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:cwi:oai:cwi.nl:16726","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/16726","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 39(6), 2212 - 2231","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:cwi.nl:13979","is_oa":false,"landing_page_url":"https://ir.cwi.nl/pub/13979","pdf_url":null,"source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/other"},{"id":"pmh:oai:infoscience.epfl.ch:144056","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/144056","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:library.tue.nl:664192","is_oa":false,"landing_page_url":"http://repository.tue.nl/664192","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:tudelft.nl:uuid:6fced52a-3e9e-4684-bd31-0a3c27ad3b45","is_oa":false,"landing_page_url":"http://resolver.tudelft.nl/uuid:6fced52a-3e9e-4684-bd31-0a3c27ad3b45","pdf_url":null,"source":{"id":"https://openalex.org/S4306400906","display_name":"Research Repository (Delft University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98358874","host_organization_name":"Delft University of Technology","host_organization_lineage":["https://openalex.org/I98358874"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"journal article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/aec95eb2-96a9-4d4e-90ba-0796afa422fd","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/aec95eb2-96a9-4d4e-90ba-0796afa422fd","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 10th International Workshop on Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques (APPROX 2007) and of the 11th International Workshop (RANDOM 2007) 20-22 August 2007, Princeton, New Jersey, USA, 29 - 43","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"doi:10.48550/arxiv.cs/0703010","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.cs/0703010","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"mag:2574266776","is_oa":false,"landing_page_url":"https://www.narcis.nl/publication/RecordID/oai%3Acwi.nl%3A13979","pdf_url":null,"source":{"id":"https://openalex.org/S4306507474","display_name":"CWI. Probability, Networks and Algorithms [PNA]","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"CWI. Probability, Networks and Algorithms [PNA]","raw_type":null}],"best_oa_location":{"id":"pmh:oai:arXiv.org:cs/0703010","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0703010","pdf_url":"https://arxiv.org/pdf/cs/0703010","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6009445997","display_name":null,"funder_award_id":"unknown","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G629491556","display_name":null,"funder_award_id":"(NWO)","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320320885","display_name":"European Research Consortium for Informatics and Mathematics","ror":"https://ror.org/055zrhj18"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1973315504","https://openalex.org/W1973529814","https://openalex.org/W1978117135","https://openalex.org/W1987503114","https://openalex.org/W1998735557","https://openalex.org/W2033647570","https://openalex.org/W2035749132","https://openalex.org/W2046554800","https://openalex.org/W2130956934","https://openalex.org/W2143996311","https://openalex.org/W3136436047","https://openalex.org/W4243637616"],"related_works":["https://openalex.org/W2109549136","https://openalex.org/W1556407051","https://openalex.org/W2034322246","https://openalex.org/W2374100080","https://openalex.org/W115508274","https://openalex.org/W3027766390","https://openalex.org/W2591109193","https://openalex.org/W1965255372","https://openalex.org/W2966432004","https://openalex.org/W1511921300","https://openalex.org/W2119402945","https://openalex.org/W2735184074","https://openalex.org/W2145358871","https://openalex.org/W1567012618","https://openalex.org/W3120306418","https://openalex.org/W1594413663","https://openalex.org/W3108076861","https://openalex.org/W2244037217","https://openalex.org/W2011595401","https://openalex.org/W1512148653"],"abstract_inverted_index":{"We":[0,161],"obtain":[1,118,149],"a":[2,42,78,89,115,133],"1.5-approximation":[3],"algorithm":[4,21,40,44,83,91,123,135,168],"for":[5,92,124,156,174],"the":[6,16,29,46,63,66,81,93,98,103,119,150,157,171,175],"metric":[7,158],"uncapacitated":[8],"facility":[9,64],"location":[10],"(UFL)":[11],"problem,":[12],"which":[13,76],"improves":[14],"on":[15],"previously":[17],"best":[18],"known":[19],"1.52-approximation":[20],"by":[22,33,109,127,137,144],"Mahdian,":[23,111],"Ye,":[24],"and":[25,35,60,65,86,96,112,141],"Zhang.":[26],"Note":[27],"that":[28,101],"approximability":[30,104],"lower":[31],"bound":[32],"Guha":[34],"Khuller":[36],"is":[37,41,77,88,97],"$1.463\\dots$.":[38],"An":[39],"($\\lambda_f$,$\\lambda_c$)-approximation":[43],"if":[45],"solution":[47],"it":[48],"produces":[49],"has":[50],"total":[51],"cost":[52,68],"at":[53],"most":[54],"$\\lambda_f\\cdot":[55],"F^*+\\lambda_c\\cdot":[56],"C^*$,":[57],"where":[58],"$F^*$":[59],"$C^*$":[61],"are":[62],"connection":[67,128],"of":[69,80,84,154,178],"an":[70],"optimal":[71,121],"solution.":[72],"Our":[73],"new":[74],"algorithm,":[75],"modification":[79],"$(1+2/e)$-approximation":[82],"Chudak":[85],"Shmoys,":[87],"$(1.6774,1.3738)$-approximation":[90],"UFL":[94,159],"problem":[95],"first":[99,120],"one":[100],"touches":[102],"limit":[105],"curve":[106],"$(\\gamma_f,1+2e^{-\\gamma_f})$":[107],"established":[108],"Jain,":[110],"Saberi.":[113],"As":[114],"consequence,":[116],"we":[117,148],"approximation":[122,152,172],"instances":[125],"dominated":[126],"costs.":[129],"When":[130],"combined":[131],"with":[132],"$(1.11,1.7764)$-approximation":[134],"proposed":[136],"Jain":[138],"et":[139,146],"al.,":[140,147],"later":[142],"analyzed":[143],"Mahdian":[145],"overall":[151],"guarantee":[153],"1.5":[155],"problem.":[160],"also":[162],"describe":[163],"how":[164],"to":[165,169],"use":[166],"our":[167],"improve":[170],"ratio":[173],"3-level":[176],"version":[177],"UFL.":[179]},"counts_by_year":[],"updated_date":"2026-04-14T08:04:32.555800","created_date":"2022-10-06T00:00:00"}