{"id":"https://openalex.org/W2120679858","doi":"https://doi.org/10.1007/s00453-003-1069-7","title":"Approximation Algorithms for a Capacitated Network Design Problem","display_name":"Approximation Algorithms for a Capacitated Network Design Problem","publication_year":2003,"publication_date":"2003-12-08","ids":{"openalex":"https://openalex.org/W2120679858","doi":"https://doi.org/10.1007/s00453-003-1069-7","mag":"2120679858"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-003-1069-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-003-1069-7","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/A5022008503","display_name":"Refael Hassin","orcid":"https://orcid.org/0000-0001-9631-6162"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Refael Hassin","raw_affiliation_strings":["Department of Statistics and Operations Research,\nTel Aviv University, Tel Aviv 69978, Israel","Department of Statistics and Operations Research, Tel Aviv University, Tel Aviv 69978"],"affiliations":[{"raw_affiliation_string":"Department of Statistics and Operations Research,\nTel Aviv University, Tel Aviv 69978, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Department of Statistics and Operations Research, Tel Aviv University, Tel Aviv 69978","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087844619","display_name":"R. Ravi","orcid":"https://orcid.org/0000-0001-7603-1207"},"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":"R. Ravi","raw_affiliation_strings":["GSIA, Carnegie Mellon University, Pittsburgh, PA 15213, USA","GSIA, Carnegie Mellon University, Pittsburgh, PA 15213"],"affiliations":[{"raw_affiliation_string":"GSIA, Carnegie Mellon University, Pittsburgh, PA 15213, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"GSIA, Carnegie Mellon University, Pittsburgh, PA 15213","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058340908","display_name":"F. Sibel Salman","orcid":"https://orcid.org/0000-0001-6833-2552"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"F. Sibel Salman","raw_affiliation_strings":["Krannert School of Management, Purdue University, West Lafayette, IN 47907, USA","Krannert School of Management; Purdue University; West Lafayette IN 47907"],"affiliations":[{"raw_affiliation_string":"Krannert School of Management, Purdue University, West Lafayette, IN 47907, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Krannert School of Management; Purdue University; West Lafayette IN 47907","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5022008503"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.4677,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.89332546,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"38","issue":"3","first_page":"417","last_page":"431"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9972000122070312,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9822999835014343,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.9050742387771606},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7163763642311096},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.6835088133811951},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6820505261421204},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.6470462679862976},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.6196703910827637},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5697322487831116},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5685170888900757},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5224327445030212},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.492485374212265},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.4902973473072052},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4559015929698944},{"id":"https://openalex.org/keywords/tree-network","display_name":"Tree network","score":0.4316670298576355},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4137056767940521},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35794222354888916},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.24528691172599792},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.16919919848442078}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9050742387771606},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7163763642311096},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.6835088133811951},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6820505261421204},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.6470462679862976},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.6196703910827637},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5697322487831116},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5685170888900757},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5224327445030212},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.492485374212265},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.4902973473072052},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4559015929698944},{"id":"https://openalex.org/C2781010653","wikidata":"https://www.wikidata.org/wiki/Q12056602","display_name":"Tree network","level":3,"score":0.4316670298576355},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4137056767940521},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35794222354888916},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.24528691172599792},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.16919919848442078},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-003-1069-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-003-1069-7","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W109985799","https://openalex.org/W1485792125","https://openalex.org/W1532411173","https://openalex.org/W1566486010","https://openalex.org/W1818184450","https://openalex.org/W1971724331","https://openalex.org/W1972674272","https://openalex.org/W1990317614","https://openalex.org/W1990327548","https://openalex.org/W2003882909","https://openalex.org/W2006621964","https://openalex.org/W2012130001","https://openalex.org/W2020112047","https://openalex.org/W2025325419","https://openalex.org/W2027278505","https://openalex.org/W2034457158","https://openalex.org/W2059707428","https://openalex.org/W2106627221","https://openalex.org/W2164581054","https://openalex.org/W2408061268","https://openalex.org/W3127447045","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3035974271","https://openalex.org/W3141113327","https://openalex.org/W3161514703","https://openalex.org/W2080904092","https://openalex.org/W1994440468","https://openalex.org/W4206915070","https://openalex.org/W2182648737","https://openalex.org/W2051329268","https://openalex.org/W2120679858","https://openalex.org/W1974503539"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}