{"id":"https://openalex.org/W2078422037","doi":"https://doi.org/10.1017/s096354830600798x","title":"On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem","display_name":"On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem","publication_year":2006,"publication_date":"2006-08-29","ids":{"openalex":"https://openalex.org/W2078422037","doi":"https://doi.org/10.1017/s096354830600798x","mag":"2078422037"},"language":"en","primary_location":{"id":"doi:10.1017/s096354830600798x","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s096354830600798x","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","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/A5055212893","display_name":"Abraham D. Flaxman","orcid":"https://orcid.org/0000-0001-6033-4713"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"ABRAHAM D. FLAXMAN","raw_affiliation_strings":["Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA, 15213, USA (e-mail:","Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA, 15213, USA (e-mail:","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056950019","display_name":"Alan Frieze","orcid":"https://orcid.org/0000-0002-8481-5615"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"ALAN M. FRIEZE","raw_affiliation_strings":["Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA, 15213, USA (e-mail:","Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA, 15213, USA (e-mail:","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002345780","display_name":"Juan C. Vera","orcid":"https://orcid.org/0000-0003-1394-3422"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"JUAN CARLOS VERA","raw_affiliation_strings":["Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA, 15213, USA (e-mail:","Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA, 15213, USA (e-mail:","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3373,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.62217804,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"16","issue":"5","first_page":"713","last_page":"732"},"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.9991999864578247,"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.9991999864578247,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9973999857902527,"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/heuristics","display_name":"Heuristics","score":0.7289919853210449},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.6999356746673584},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6713546514511108},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5794515609741211},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.5672772526741028},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5652554035186768},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5311822891235352},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4939008355140686},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49081334471702576},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.4553930163383484},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4477503299713135},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4222591817378998}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7289919853210449},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.6999356746673584},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6713546514511108},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5794515609741211},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.5672772526741028},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5652554035186768},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5311822891235352},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4939008355140686},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49081334471702576},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.4553930163383484},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4477503299713135},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4222591817378998},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s096354830600798x","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s096354830600798x","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.66.6200","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.6200","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.cmu.edu/~af1p/Texfiles/facloc.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.69.3452","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.3452","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.aladdin.cs.cmu.edu/papers/pdfs/y2005/appalg.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":17,"referenced_works":["https://openalex.org/W630423399","https://openalex.org/W1489238841","https://openalex.org/W1544228104","https://openalex.org/W1592737213","https://openalex.org/W1595318379","https://openalex.org/W1696776098","https://openalex.org/W1854155592","https://openalex.org/W1891203375","https://openalex.org/W1978117135","https://openalex.org/W1987178221","https://openalex.org/W1992428442","https://openalex.org/W2052494364","https://openalex.org/W2067292487","https://openalex.org/W2084294018","https://openalex.org/W2088659184","https://openalex.org/W2168881041","https://openalex.org/W6604656840"],"related_works":["https://openalex.org/W1973529814","https://openalex.org/W1509863433","https://openalex.org/W1991566967","https://openalex.org/W2173317315","https://openalex.org/W1489978714","https://openalex.org/W2810411596","https://openalex.org/W1854155592","https://openalex.org/W2499461890","https://openalex.org/W2476148062","https://openalex.org/W276709744"],"abstract_inverted_index":{"In":[0,70],"combinatorial":[1],"optimization,":[2],"a":[3,27,32,151],"popular":[4],"approach":[5],"to":[6,25,45,64,78,116],"NP-hard":[7],"problems":[8],"is":[9,30,42,114],"the":[10,39,75,85,93,128],"design":[11],"of":[12,36,87],"approximation":[13,58,90],"algorithms.":[14],"These":[15],"algorithms":[16,59,91,139],"typically":[17],"run":[18],"in":[19,48,55,127],"polynomial":[20],"time":[21],"and":[22,103,106,109],"are":[23],"guaranteed":[24],"produce":[26,61],"solution":[28],"which":[29],"within":[31],"known":[33,40,44],"multiplicative":[34],"factor":[35,41],"optimal.":[37],"Unfortunately,":[38],"often":[43],"be":[46],"large":[47],"pathological":[49],"instances.":[50],"Conventional":[51],"wisdom":[52],"holds":[53],"that,":[54,133],"practice":[56],",":[57],"will":[60],"solutions":[62],"closer":[63],"optimal":[65,144,160],"than":[66],"their":[67],"proven":[68],"guarantees.":[69],"this":[71,80],"paper,":[72],"we":[73],"use":[74],"rigorous-analysis-of-heuristics":[76],"framework":[77],"investigate":[79],"conventional":[81],"wisdom.":[82],"We":[83,131],"analyse":[84],"performance":[86],"three":[88],"related":[89],"for":[92],"uncapacitated":[94],"facility":[95],"location":[96],"problem":[97],"(from":[98],"Jain,":[99],"Mahdian,":[100,107],"Markakis,":[101],"Saberi":[102],"Vazirani":[104],"(2003)":[105],"Ye":[108],"Zhang":[110],"(2002))":[111],"when":[112],"each":[113],"applied":[115],"an":[117,158],"instances":[118],"created":[119],"by":[120],"placing":[121],"n":[122],"points":[123],"uniformly":[124],"at":[125],"random":[126],"unit":[129],"square.":[130],"find":[132,142,157],"with":[134,148],"high":[135,149],"probability,":[136,150],"these":[137],"3":[138],"do":[140],"not":[141],"asymptotically":[143,159],"solutions,":[145],"and,":[146],"also":[147],"simple":[152],"plane":[153],"partitioning":[154],"heuristic":[155],"does":[156],"solution.":[161]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}