{"id":"https://openalex.org/W2085573573","doi":"https://doi.org/10.4304/jsw.8.9.2360-2366","title":"A Fast Algorithm for Facility Location Problem","display_name":"A Fast Algorithm for Facility Location Problem","publication_year":2013,"publication_date":"2013-09-12","ids":{"openalex":"https://openalex.org/W2085573573","doi":"https://doi.org/10.4304/jsw.8.9.2360-2366","mag":"2085573573"},"language":"en","primary_location":{"id":"doi:10.4304/jsw.8.9.2360-2366","doi":"https://doi.org/10.4304/jsw.8.9.2360-2366","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jsw.8.9.2360-2366","pdf_url":null,"source":{"id":"https://openalex.org/S114141714","display_name":"Journal of Software","issn_l":"1796-217X","issn":["1796-217X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Software","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"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/A5109184956","display_name":"Wenhao Shu","orcid":"https://orcid.org/0000-0003-2422-6760","observed_orcids":["https://orcid.org/0000-0003-2422-6760"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Wenhao Shu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5109184956"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3369,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.51271978,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":93},"biblio":{"volume":"8","issue":"9","first_page":null,"last_page":null},"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.9765999913215637,"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.9765999913215637,"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.008799999952316284,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.005200000014156103,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/uncapacitated-facility-location-problem","display_name":"uncapacitated facility location","score":0.953000009059906},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.9470000267028809},{"id":"https://openalex.org/keywords/approximation-ratio","display_name":"approximation ratio","score":0.7639999985694885},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.8510000109672546}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8241111040115356},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.7853912115097046},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7247123718261719},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.6632668972015381},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5700476169586182},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.4869714677333832},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38729310035705566},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12723657488822937},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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":1,"locations":[{"id":"doi:10.4304/jsw.8.9.2360-2366","doi":"https://doi.org/10.4304/jsw.8.9.2360-2366","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jsw.8.9.2360-2366","pdf_url":null,"source":{"id":"https://openalex.org/S114141714","display_name":"Journal of Software","issn_l":"1796-217X","issn":["1796-217X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W113414296","https://openalex.org/W181296567","https://openalex.org/W1494877466","https://openalex.org/W1891203375","https://openalex.org/W1964276725","https://openalex.org/W1971680805","https://openalex.org/W1973529814","https://openalex.org/W2003207175","https://openalex.org/W2006514056","https://openalex.org/W2010410498","https://openalex.org/W2033647570","https://openalex.org/W2035749132","https://openalex.org/W2052494364","https://openalex.org/W2083653011","https://openalex.org/W2089364251","https://openalex.org/W2139841919","https://openalex.org/W2157424698","https://openalex.org/W2160435628","https://openalex.org/W2177090493","https://openalex.org/W2286452808","https://openalex.org/W2574266776","https://openalex.org/W2608158342","https://openalex.org/W2611804663","https://openalex.org/W3100218344","https://openalex.org/W3148765228","https://openalex.org/W4243637616"],"related_works":["https://openalex.org/W7095435379","https://openalex.org/W2054475294","https://openalex.org/W7100219015","https://openalex.org/W7098807186","https://openalex.org/W1973529814","https://openalex.org/W7099662078","https://openalex.org/W7096421826","https://openalex.org/W7100273992","https://openalex.org/W7096760196","https://openalex.org/W1601812897"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"present":[4],"an":[5],"approximation":[6,9,47,64],"algorithm":[7,26,65,72],"achieving":[8],"guarantee":[10],"of":[11,23,33,41,70],"2":[12],"for":[13],"the":[14,28,39,46,54,63,68],"classical":[15],"uncapacitated":[16],"facility":[17],"location":[18],"problem.":[19],"The":[20],"distinguishing":[21],"feature":[22],"our":[24,71],"designed":[25],"is":[27,49,57,73],"overall":[29],"low":[30],"running":[31,55,80],"time":[32,56],",":[34,36,58],"where":[35,59],"and":[37,43],"are":[38],"number":[40],"cities":[42],"facilities.":[44],"Though":[45],"factor":[48],"1.61":[50],"in":[51,66],"Ref.[1],":[52,67],"whereas":[53],".":[60],"Compared":[61],"with":[62,78],"advantage":[69],"it":[74],"has":[75],"more":[76],"applications":[77],"lower":[79],"time.":[81]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}
