{"id":"https://openalex.org/W1555221261","doi":"https://doi.org/10.1007/s00453-013-9862-4","title":"Approximability of Capacitated Network Design","display_name":"Approximability of Capacitated Network Design","publication_year":2014,"publication_date":"2014-01-06","ids":{"openalex":"https://openalex.org/W1555221261","doi":"https://doi.org/10.1007/s00453-013-9862-4","mag":"1555221261"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-013-9862-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-013-9862-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-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/A5069364300","display_name":"Deeparnab Chakrabarty","orcid":"https://orcid.org/0000-0001-7596-6035"},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Deeparnab Chakrabarty","raw_affiliation_strings":["Microsoft Research, India, 9, Lavelle Road, Bangalore, Karnataka, 560001, India","Microsoft Research India, Bangalore, India - 560001#TAB#"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, India, 9, Lavelle Road, Bangalore, Karnataka, 560001, India","institution_ids":["https://openalex.org/I4210124949"]},{"raw_affiliation_string":"Microsoft Research India, Bangalore, India - 560001#TAB#","institution_ids":["https://openalex.org/I4210124949"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036503505","display_name":"Chandra Chekuri","orcid":"https://orcid.org/0000-0003-3035-1699"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chandra Chekuri","raw_affiliation_strings":["Dept. of Computer Science, University of Illinois, Urbana, IL, 61801, USA","Department of Computer Science, University of Illinois, Urbana, USA 61801"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Illinois, Urbana, IL, 61801, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Department of Computer Science, University of Illinois, Urbana, USA 61801","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039619350","display_name":"Sanjeev Khanna","orcid":"https://orcid.org/0009-0000-2601-1689"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanjeev Khanna","raw_affiliation_strings":["Dept. of Computer & Information Science, University of Pennsylvania, Philadelphia, PA, 19104, USA","Department of Computer and Information Science, University of Pennsylvania, Philadelphia, USA 19104#TAB#"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer & Information Science, University of Pennsylvania, Philadelphia, PA, 19104, USA","institution_ids":["https://openalex.org/I79576946"]},{"raw_affiliation_string":"Department of Computer and Information Science, University of Pennsylvania, Philadelphia, USA 19104#TAB#","institution_ids":["https://openalex.org/I79576946"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009276272","display_name":"Nitish Korula","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":"Nitish Korula","raw_affiliation_strings":["Google Inc., 76 Ninth Ave., New York, NY, 10011, USA","Google, Inc., New York, USA 10011#TAB#"],"affiliations":[{"raw_affiliation_string":"Google Inc., 76 Ninth Ave., New York, NY, 10011, USA","institution_ids":["https://openalex.org/I1291425158"]},{"raw_affiliation_string":"Google, Inc., New York, USA 10011#TAB#","institution_ids":["https://openalex.org/I1291425158"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5069364300"],"corresponding_institution_ids":["https://openalex.org/I4210124949"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.3675,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.60126034,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"72","issue":"2","first_page":"493","last_page":"514"},"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.998199999332428,"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.998199999332428,"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.9824000000953674,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9810000061988831,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.70468670129776},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.6896008849143982},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6684859991073608},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6429834365844727},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6321750283241272},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5896314382553101},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5644471645355225},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.5341001749038696},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.5150682330131531},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5064376592636108},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.46946752071380615},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.4621361792087555},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.4302121102809906},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4152299761772156},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.3541163206100464},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.35219091176986694},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3373745083808899},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2176806628704071},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17254158854484558}],"concepts":[{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.70468670129776},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.6896008849143982},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6684859991073608},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6429834365844727},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6321750283241272},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5896314382553101},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5644471645355225},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.5341001749038696},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5150682330131531},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5064376592636108},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.46946752071380615},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.4621361792087555},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.4302121102809906},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4152299761772156},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3541163206100464},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.35219091176986694},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3373745083808899},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2176806628704071},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17254158854484558},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-013-9862-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-013-9862-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:repository.upenn.edu:cis_papers-1701","is_oa":false,"landing_page_url":"https://repository.upenn.edu/cis_papers/664","pdf_url":null,"source":{"id":"https://openalex.org/S4306402083","display_name":"ScholarlyCommons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Departmental Papers (CIS)","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4000000059604645,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W171788235","https://openalex.org/W1496921672","https://openalex.org/W1968690018","https://openalex.org/W1970259241","https://openalex.org/W1975789655","https://openalex.org/W1984628625","https://openalex.org/W1989224473","https://openalex.org/W2018511415","https://openalex.org/W2020400310","https://openalex.org/W2033249500","https://openalex.org/W2037408498","https://openalex.org/W2052788366","https://openalex.org/W2056886715","https://openalex.org/W2114587443","https://openalex.org/W2117768313","https://openalex.org/W2148352980","https://openalex.org/W2148965337","https://openalex.org/W2149929647","https://openalex.org/W2163193155","https://openalex.org/W2166747457","https://openalex.org/W2167621755","https://openalex.org/W2169143327","https://openalex.org/W2172955861","https://openalex.org/W2295428206","https://openalex.org/W2295961103","https://openalex.org/W2398523608","https://openalex.org/W2405374478","https://openalex.org/W2505968561","https://openalex.org/W2568450825","https://openalex.org/W3144422206","https://openalex.org/W3153460966","https://openalex.org/W4231916799","https://openalex.org/W4245266864","https://openalex.org/W4255005259","https://openalex.org/W4300273322"],"related_works":["https://openalex.org/W2937242299","https://openalex.org/W3127652808","https://openalex.org/W132011890","https://openalex.org/W3143387519","https://openalex.org/W4242016769","https://openalex.org/W276709744","https://openalex.org/W2028549267","https://openalex.org/W2087658830","https://openalex.org/W2468851130","https://openalex.org/W1784610412"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}