{"id":"https://openalex.org/W43978825","doi":"https://doi.org/10.1007/978-3-642-31155-0_21","title":"New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem","display_name":"New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W43978825","doi":"https://doi.org/10.1007/978-3-642-31155-0_21","mag":"43978825"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-31155-0_21","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-31155-0_21","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5037762121","display_name":"Babak Behsaz","orcid":"https://orcid.org/0000-0003-3313-0322"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Babak Behsaz","raw_affiliation_strings":["Dept. of Computing Sci., Univ. of Alberta, Edmonton, Alberta, T6G 2E8, Canada"],"affiliations":[{"raw_affiliation_string":"Dept. of Computing Sci., Univ. of Alberta, Edmonton, Alberta, T6G 2E8, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010339836","display_name":"Mohammad R. Salavatipour","orcid":"https://orcid.org/0000-0002-7650-2045"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Mohammad R. Salavatipour","raw_affiliation_strings":["Dept. of Computing Sci., Univ. of Alberta, Edmonton, Alberta, T6G 2E8, Canada"],"affiliations":[{"raw_affiliation_string":"Dept. of Computing Sci., Univ. of Alberta, Edmonton, Alberta, T6G 2E8, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025880780","display_name":"Zoya Svitkina","orcid":null},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zoya Svitkina","raw_affiliation_strings":["Google Inc., 1600 Amphitheatre Parkway, Mountain View, CA, 94043, USA"],"affiliations":[{"raw_affiliation_string":"Google Inc., 1600 Amphitheatre Parkway, Mountain View, CA, 94043, USA","institution_ids":["https://openalex.org/I1291425158"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5037762121"],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.767,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.92723586,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"237","last_page":"248"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9988999962806702,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"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.9973000288009644,"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.8562673330307007},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6721369028091431},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.6423363089561462},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6218006610870361},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5712929964065552},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5351470708847046},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.4856952130794525},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.48437413573265076},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4718475341796875},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45347172021865845},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4471113681793213},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.4253891408443451},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.414020299911499},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.411738783121109},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4038435220718384},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35611093044281006},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10941752791404724},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06259047985076904},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06022840738296509}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.8562673330307007},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6721369028091431},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.6423363089561462},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6218006610870361},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5712929964065552},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5351470708847046},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.4856952130794525},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.48437413573265076},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4718475341796875},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45347172021865845},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4471113681793213},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.4253891408443451},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.414020299911499},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.411738783121109},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4038435220718384},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35611093044281006},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10941752791404724},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06259047985076904},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06022840738296509},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-31155-0_21","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-31155-0_21","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1516365398","https://openalex.org/W1606599877","https://openalex.org/W1966016308","https://openalex.org/W2014369282","https://openalex.org/W2033687872","https://openalex.org/W2076746184","https://openalex.org/W2101622070","https://openalex.org/W2106850014","https://openalex.org/W2110367141","https://openalex.org/W2157089136","https://openalex.org/W3148765228","https://openalex.org/W4232384064"],"related_works":["https://openalex.org/W1973529814","https://openalex.org/W1509863433","https://openalex.org/W2810411596","https://openalex.org/W2499461890","https://openalex.org/W2962917430","https://openalex.org/W2246386411","https://openalex.org/W2171134634","https://openalex.org/W1561811279","https://openalex.org/W1606488336","https://openalex.org/W2377915845"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}