{"id":"https://openalex.org/W2104507648","doi":"https://doi.org/10.1145/1810479.1810535","title":"Parallel approximation algorithms for facility-location problems","display_name":"Parallel approximation algorithms for facility-location problems","publication_year":2010,"publication_date":"2010-06-13","ids":{"openalex":"https://openalex.org/W2104507648","doi":"https://doi.org/10.1145/1810479.1810535","mag":"2104507648"},"language":"en","primary_location":{"id":"doi:10.1145/1810479.1810535","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1810479.1810535","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures","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/A5033930662","display_name":"Guy E. Blelloch","orcid":"https://orcid.org/0000-0003-0224-9187"},"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":"Guy E. Blelloch","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA","Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054849628","display_name":"Kanat Tangwongsan","orcid":"https://orcid.org/0000-0001-9775-8165"},"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":"Kanat Tangwongsan","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA","Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4048,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.88881494,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"315","last_page":"324"},"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.9994000196456909,"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.9994000196456909,"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.9975000023841858,"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.9955000281333923,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.7631151676177979},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7493484020233154},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6855930685997009},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5705916285514832},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5686041116714478},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5236092209815979},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4364212453365326},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.425159752368927},{"id":"https://openalex.org/keywords/center","display_name":"Center (category theory)","score":0.4244455397129059},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3361109495162964},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33479204773902893},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.24272221326828003},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19128355383872986}],"concepts":[{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.7631151676177979},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7493484020233154},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6855930685997009},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5705916285514832},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5686041116714478},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5236092209815979},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4364212453365326},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.425159752368927},{"id":"https://openalex.org/C2779463800","wikidata":"https://www.wikidata.org/wiki/Q5062222","display_name":"Center (category theory)","level":2,"score":0.4244455397129059},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3361109495162964},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33479204773902893},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.24272221326828003},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19128355383872986},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","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},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1810479.1810535","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1810479.1810535","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.6299999952316284,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W113414296","https://openalex.org/W1529111168","https://openalex.org/W1601812897","https://openalex.org/W1696776098","https://openalex.org/W1879645764","https://openalex.org/W1965897365","https://openalex.org/W1973264045","https://openalex.org/W1978117135","https://openalex.org/W1978583881","https://openalex.org/W1988837529","https://openalex.org/W2003207175","https://openalex.org/W2025050335","https://openalex.org/W2029483371","https://openalex.org/W2033647570","https://openalex.org/W2035994564","https://openalex.org/W2044028871","https://openalex.org/W2052494364","https://openalex.org/W2063241141","https://openalex.org/W2073583237","https://openalex.org/W2076746184","https://openalex.org/W2085751730","https://openalex.org/W2089064856","https://openalex.org/W2090964330","https://openalex.org/W2097755092","https://openalex.org/W2100061495","https://openalex.org/W2101622070","https://openalex.org/W2107390991","https://openalex.org/W2109549136","https://openalex.org/W2120490947","https://openalex.org/W2139841919","https://openalex.org/W2144970024","https://openalex.org/W2151757686","https://openalex.org/W2157424698","https://openalex.org/W2163656645","https://openalex.org/W2166590374","https://openalex.org/W2199495299","https://openalex.org/W2295428206","https://openalex.org/W2608158342","https://openalex.org/W4236385439","https://openalex.org/W4243637616","https://openalex.org/W4247322843"],"related_works":["https://openalex.org/W2935647112","https://openalex.org/W1973529814","https://openalex.org/W1509863433","https://openalex.org/W2810411596","https://openalex.org/W1854155592","https://openalex.org/W1991566967","https://openalex.org/W2499461890","https://openalex.org/W2476148062","https://openalex.org/W276709744","https://openalex.org/W4385597667"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"the":[3,34,38,47,62,66,111],"design":[4],"and":[5,16,25,114],"analysis":[6],"of":[7,61,77,89],"parallel":[8,96],"approximation":[9,39,48,80],"algorithms":[10,18,40,81,102],"for":[11,19,82,92],"facility-location":[12,83],"problems,":[13,84],"including":[14],"NC":[15],"RNC":[17],"(metric)":[20],"facility":[21],"location,":[22],"k-center,":[23],"k-median,":[24],"k-means.":[26],"These":[27],"problems":[28],"have":[29],"received":[30],"considerable":[31],"attention":[32],"during":[33],"past":[35],"decades":[36],"from":[37,65],"community,":[41],"which":[42],"primarily":[43],"concentrates":[44],"on":[45,100],"improving":[46],"guarantees.":[49],"In":[50],"this":[51],"paper,":[52],"we":[53],"ask:":[54],"Is":[55],"it":[56],"possible":[57],"to":[58,110],"parallelize":[59],"some":[60],"beautiful":[63],"results":[64,78],"sequential":[67,112],"setting?.Our":[68],"starting":[69],"point":[70],"is":[71],"a":[72,86],"small,":[73],"but":[74],"diverse,":[75],"subset":[76],"in":[79],"with":[85,103],"primary":[87],"goal":[88],"developing":[90],"techniques":[91],"devising":[93],"their":[94],"efficient":[95],"counterparts.":[97],"We":[98],"focus":[99],"giving":[101],"low":[104,115],"depth,":[105],"near":[106],"work":[107],"efficiency":[108],"(compared":[109],"versions),":[113],"cache":[116],"complexity.":[117]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}