{"id":"https://openalex.org/W2128671402","doi":"https://doi.org/10.5120/11436-6621","title":"Approximation Algorithm for Facility Location Problems","display_name":"Approximation Algorithm for Facility Location Problems","publication_year":2013,"publication_date":"2013-04-18","ids":{"openalex":"https://openalex.org/W2128671402","doi":"https://doi.org/10.5120/11436-6621","mag":"2128671402"},"language":"en","primary_location":{"id":"doi:10.5120/11436-6621","doi":"https://doi.org/10.5120/11436-6621","is_oa":true,"landing_page_url":"http://doi.org/10.5120/11436-6621","pdf_url":"https://doi.org/10.5120/11436-6621","source":{"id":"https://openalex.org/S4210206007","display_name":"International Journal of Computer Applications","issn_l":"0975-8887","issn":["0975-8887"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core"],"host_organization":"https://openalex.org/P4322545532","host_organization_name":"Foundation of Computer Science","host_organization_lineage":["https://openalex.org/P4322545532"],"host_organization_lineage_names":["Foundation of Computer Science"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Applications","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://doi.org/10.5120/11436-6621","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021138957","display_name":"Pawan KumarPatel","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Pawan KumarPatel","raw_affiliation_strings":["Department of Computer Science & Engineering Indian Institute of Technology, Kanpur, INDIA Karnataka, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering Indian Institute of Technology, Kanpur, INDIA Karnataka, India","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084774243","display_name":"Vivek Kumar Sharma","orcid":"https://orcid.org/0000-0003-1374-9865","observed_orcids":["https://orcid.org/0000-0003-1374-9865"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vivek Sharma","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3369,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.51271978,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":"67","issue":"11","first_page":"1","last_page":"5"},"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.9872999787330627,"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.9872999787330627,"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.003000000026077032,"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/T12288","display_name":"Optimization and Search Problems","score":0.002300000051036477,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/facility-location","display_name":"facility location","score":0.9950000047683716},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.9769999980926514},{"id":"https://openalex.org/keywords/primal-dual-algorithm","display_name":"primal-dual algorithm","score":0.8600000143051147},{"id":"https://openalex.org/keywords/np-hard-problems","display_name":"NP-hard problems","score":0.9520000219345093},{"id":"https://openalex.org/keywords/performance-guarantees","display_name":"performance guarantees","score":0.8180000185966492}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8787906169891357},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.5919925570487976},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3731675148010254},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3628556728363037},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.05596110224723816}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.5120/11436-6621","doi":"https://doi.org/10.5120/11436-6621","is_oa":true,"landing_page_url":"http://doi.org/10.5120/11436-6621","pdf_url":"https://doi.org/10.5120/11436-6621","source":{"id":"https://openalex.org/S4210206007","display_name":"International Journal of Computer Applications","issn_l":"0975-8887","issn":["0975-8887"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core"],"host_organization":"https://openalex.org/P4322545532","host_organization_name":"Foundation of Computer Science","host_organization_lineage":["https://openalex.org/P4322545532"],"host_organization_lineage_names":["Foundation of Computer Science"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Applications","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.403.8283","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.403.8283","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.ijcaonline.org/volume67/number11/pxc3886621.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.5120/11436-6621","doi":"https://doi.org/10.5120/11436-6621","is_oa":true,"landing_page_url":"http://doi.org/10.5120/11436-6621","pdf_url":"https://doi.org/10.5120/11436-6621","source":{"id":"https://openalex.org/S4210206007","display_name":"International Journal of Computer Applications","issn_l":"0975-8887","issn":["0975-8887"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core"],"host_organization":"https://openalex.org/P4322545532","host_organization_name":"Foundation of Computer Science","host_organization_lineage":["https://openalex.org/P4322545532"],"host_organization_lineage_names":["Foundation of Computer Science"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2128671402.pdf","grobid_xml":"https://content.openalex.org/works/W2128671402.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W249351555","https://openalex.org/W1516365398","https://openalex.org/W1803694112","https://openalex.org/W1873451089","https://openalex.org/W1998735557","https://openalex.org/W2046554800","https://openalex.org/W2075910004","https://openalex.org/W2076746184","https://openalex.org/W2109549136","https://openalex.org/W2139841919","https://openalex.org/W2165422498","https://openalex.org/W2177090493","https://openalex.org/W2574266776","https://openalex.org/W3148765228","https://openalex.org/W4243637616"],"related_works":["https://openalex.org/W7100273992","https://openalex.org/W2908903732","https://openalex.org/W2979477539","https://openalex.org/W2054475294","https://openalex.org/W7097409136","https://openalex.org/W7163646325","https://openalex.org/W4243637616","https://openalex.org/W1991566967","https://openalex.org/W3003829025","https://openalex.org/W2144709496"],"abstract_inverted_index":{"Significant":[0],"research":[1],"effort":[2],"has":[3],"been":[4],"devoted":[5],"in":[6,47],"the":[7,36],"study":[8],"of":[9],"approximation":[10,22],"algorithms":[11],"for":[12,24,35],"NP-hard":[13],"problems.In":[14],"this":[15],"work":[16],"we":[17,28,40],"modify":[18],"a":[19,32,48],"known":[20],"primal-dual":[21],"algorithm":[23],"facility":[25],"location":[26],"problem.Although":[27],"fail":[29],"to":[30],"give":[31],"performance":[33],"guarantee":[34],"new":[37],"approach":[38],"but":[39],"show":[41],"that":[42],"our":[43],"method":[44],"performs":[45],"better":[46],"tight":[49],"case.":[50]},"counts_by_year":[{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}