{"id":"https://openalex.org/W2115334535","doi":"https://doi.org/10.1145/1060590.1060656","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":2005,"publication_date":"2005-05-22","ids":{"openalex":"https://openalex.org/W2115334535","doi":"https://doi.org/10.1145/1060590.1060656","mag":"2115334535"},"language":"en","primary_location":{"id":"doi:10.1145/1060590.1060656","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1060590.1060656","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-seventh annual ACM symposium on Theory of computing","raw_type":"proceedings-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":true,"raw_author_name":"Abraham D. Flaxman","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA","Carnegie-Mellon University, Pittsburgh, PA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, PA","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":["Carnegie Mellon University, Pittsburgh, PA","Carnegie-Mellon University, Pittsburgh, PA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, PA","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 C. Vera","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA","Carnegie-Mellon University, Pittsburgh, PA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5055212893"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":1.7568,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.84624649,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"441","last_page":"449"},"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.9980999827384949,"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.9980999827384949,"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.9976999759674072,"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.9955999851226807,"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.7206791639328003},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6986029744148254},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.6623866558074951},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.5782349109649658},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5742805004119873},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.565028727054596},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5022785663604736},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.501793384552002},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49638015031814575},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.48622599244117737},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44886812567710876},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.44061148166656494}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7206791639328003},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6986029744148254},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.6623866558074951},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.5782349109649658},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5742805004119873},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.565028727054596},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5022785663604736},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.501793384552002},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49638015031814575},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.48622599244117737},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44886812567710876},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.44061148166656494},{"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},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1060590.1060656","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1060590.1060656","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-seventh annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W113414296","https://openalex.org/W610444623","https://openalex.org/W630423399","https://openalex.org/W1489238841","https://openalex.org/W1544228104","https://openalex.org/W1551519020","https://openalex.org/W1592737213","https://openalex.org/W1595318379","https://openalex.org/W1696776098","https://openalex.org/W1803694112","https://openalex.org/W1854155592","https://openalex.org/W1891203375","https://openalex.org/W1978117135","https://openalex.org/W1987178221","https://openalex.org/W1992428442","https://openalex.org/W2033687872","https://openalex.org/W2052494364","https://openalex.org/W2067292487","https://openalex.org/W2076746184","https://openalex.org/W2084294018","https://openalex.org/W2088659184","https://openalex.org/W2809211406","https://openalex.org/W3148765228","https://openalex.org/W4234428741"],"related_works":["https://openalex.org/W1973529814","https://openalex.org/W1509863433","https://openalex.org/W2810411596","https://openalex.org/W2499461890","https://openalex.org/W1854155592","https://openalex.org/W1991566967","https://openalex.org/W2476148062","https://openalex.org/W276709744","https://openalex.org/W4385597667","https://openalex.org/W2173317315"],"abstract_inverted_index":{"In":[0,68],"combinatorial":[1],"optimization,":[2],"a":[3,26,31,146],"popular":[4],"approach":[5],"toNP-hard":[6],"problems":[7],"is":[8,29,41,109],"the":[9,38,73,82,90,123],"design":[10],"of":[11,35,84],"approximation":[12,56,87],"algorithms.":[13],"These":[14],"algorithms":[15,57,88,134],"typically":[16],"run":[17],"in":[18,47,54,122],"polynomial":[19],"time":[20],"and":[21,102],"are":[22],"guaranteed":[23],"to":[24,44,62,76,111],"produce":[25,59],"solution":[27],"which":[28],"within":[30],"known":[32,39,43],"multiplicative":[33],"factor":[34,40],"optimal.":[36],"Unfortunately,":[37],"often":[42],"be":[45],"large":[46],"pathological":[48],"instances.":[49],"Conventional":[50],"wisdom":[51],"holds":[52],"that,":[53,128],"practice,":[55],"will":[58],"solutions":[60],"closer":[61],"optimal":[63,139,155],"than":[64],"their":[65],"proven":[66],"guarantees.":[67],"this":[69,78],"paper,":[70],"we":[71],"use":[72],"rigorous-analysis-of-heuristics":[74],"framework":[75],"investigate":[77],"conventional":[79],"wisdom.We":[80],"analyze":[81],"performance":[83],"3":[85,133],"related":[86],"for":[89],"uncapacitated":[91],"facility":[92],"location":[93],"problem":[94],"(from":[95],"[Jain,":[96],"Mahdian,":[97],"Markakis,":[98],"Saberi,":[99],"Vazirani,":[100],"2003]":[101],"[Mahdian,":[103],"Ye,":[104],"Zhang,":[105],"2002])":[106],"when":[107],"each":[108],"applied":[110],"an":[112,153],"instances":[113],"created":[114],"by":[115],"placing":[116],"n":[117],"points":[118],"uniformly":[119],"at":[120],"random":[121],"unit":[124],"square.":[125],"We":[126],"find":[127,137,152],"with":[129,143],"high":[130,144],"probability,":[131,145],"these":[132],"do":[135],"not":[136],"asymptotically":[138,154],"solutions,":[140],"and,":[141],"also":[142],"simple":[147],"plane":[148],"partitioning":[149],"heuristic":[150],"does":[151],"solution.":[156]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}