{"id":"https://openalex.org/W1998141189","doi":"https://doi.org/10.1007/s00453-001-0038-2","title":"Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems","display_name":"Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems","publication_year":2001,"publication_date":"2001-09-01","ids":{"openalex":"https://openalex.org/W1998141189","doi":"https://doi.org/10.1007/s00453-001-0038-2","mag":"1998141189"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-001-0038-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-001-0038-2","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/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":true,"raw_author_name":"R. Ravi","raw_affiliation_strings":["Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA 15213-3890, USA. ravi@cmu.edu., US","Carnegie Mellon University"],"affiliations":[{"raw_affiliation_string":"Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA 15213-3890, USA. ravi@cmu.edu., US","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020293284","display_name":"Madhav Marathe","orcid":"https://orcid.org/0000-0003-1653-0658"},"institutions":[{"id":"https://openalex.org/I1343871089","display_name":"Los Alamos National Laboratory","ror":"https://ror.org/01e41cf67","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1343871089","https://openalex.org/I198811213","https://openalex.org/I4210120050"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. V. Marathe","raw_affiliation_strings":["P.O. Box 1663, MS B265, Los Alamos National Laboratory, Los Alamos, NM 87545, USA. marathe@lanl. gov., US","LOS Alamos National Laboratory"],"affiliations":[{"raw_affiliation_string":"P.O. Box 1663, MS B265, Los Alamos National Laboratory, Los Alamos, NM 87545, USA. marathe@lanl. gov., US","institution_ids":["https://openalex.org/I1343871089"]},{"raw_affiliation_string":"LOS Alamos National Laboratory","institution_ids":["https://openalex.org/I1343871089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086740853","display_name":"S. S. Ravi","orcid":"https://orcid.org/0000-0002-0893-4364"},"institutions":[{"id":"https://openalex.org/I392282","display_name":"University at Albany, State University of New York","ror":"https://ror.org/012zs8222","country_code":"US","type":"education","lineage":["https://openalex.org/I392282"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. S. Ravi","raw_affiliation_strings":["Department of Computer Science, University of Albany-SUNY, Albany, NY 12222, USA. \\{ravi,djr,hunt\\}@cs. albany.edu., US","University at Albany\u2014SUNY"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Albany-SUNY, Albany, NY 12222, USA. \\{ravi,djr,hunt\\}@cs. albany.edu., US","institution_ids":["https://openalex.org/I392282"]},{"raw_affiliation_string":"University at Albany\u2014SUNY","institution_ids":["https://openalex.org/I392282"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009388396","display_name":"Daniel J. Rosenkrantz","orcid":"https://orcid.org/0000-0002-7044-0197"},"institutions":[{"id":"https://openalex.org/I392282","display_name":"University at Albany, State University of New York","ror":"https://ror.org/012zs8222","country_code":"US","type":"education","lineage":["https://openalex.org/I392282"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. J. Rosenkrantz","raw_affiliation_strings":["Department of Computer Science, University of Albany-SUNY, Albany, NY 12222, USA. \\{ravi,djr,hunt\\}@cs. albany.edu., US","University at Albany\u2014SUNY"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Albany-SUNY, Albany, NY 12222, USA. \\{ravi,djr,hunt\\}@cs. albany.edu., US","institution_ids":["https://openalex.org/I392282"]},{"raw_affiliation_string":"University at Albany\u2014SUNY","institution_ids":["https://openalex.org/I392282"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086835651","display_name":"Harry B. Hunt","orcid":null},"institutions":[{"id":"https://openalex.org/I392282","display_name":"University at Albany, State University of New York","ror":"https://ror.org/012zs8222","country_code":"US","type":"education","lineage":["https://openalex.org/I392282"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"H. B. Hunt III","raw_affiliation_strings":["Department of Computer Science, University of Albany-SUNY, Albany, NY 12222, USA. \\{ravi,djr,hunt\\}@cs. albany.edu., US","Univ. at Albany/SUNY"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Albany-SUNY, Albany, NY 12222, USA. \\{ravi,djr,hunt\\}@cs. albany.edu., US","institution_ids":["https://openalex.org/I392282"]},{"raw_affiliation_string":"Univ. at Albany/SUNY","institution_ids":["https://openalex.org/I392282"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5087844619"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":7.008,"has_fulltext":false,"cited_by_count":125,"citation_normalized_percentile":{"value":0.96985382,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"31","issue":"1","first_page":"58","last_page":"78"},"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.9951000213623047,"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.9951000213623047,"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.9945999979972839,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9901999831199646,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8399932980537415},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.7979044318199158},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7351717948913574},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.703579306602478},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6110626459121704},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5573409199714661},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5314269065856934},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.49723556637763977},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48876142501831055},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4650700092315674},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.45014363527297974},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4249686598777771},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4221065640449524},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4178350865840912},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.41256946325302124},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23981094360351562}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8399932980537415},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.7979044318199158},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7351717948913574},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.703579306602478},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6110626459121704},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5573409199714661},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5314269065856934},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.49723556637763977},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48876142501831055},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4650700092315674},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.45014363527297974},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4249686598777771},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4221065640449524},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4178350865840912},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.41256946325302124},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23981094360351562},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s00453-001-0038-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-001-0038-2","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.cmu.edu:tepper-1404","is_oa":false,"landing_page_url":"http://repository.cmu.edu/cgi/viewcontent.cgi?article=1404&context=tepper","pdf_url":null,"source":{"id":"https://openalex.org/S4306400668","display_name":"Research Showcase @ Carnegie Mellon University (Carnegie Mellon University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Tepper School of Business","raw_type":"text"},{"id":"pmh:doi:10.1184/r1/6703859","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal contribution"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.305.689","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.305.689","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.710.5615","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.710.5615","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.contrib.andrew.cmu.edu/%7Eravi/bmst-algorithmica.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W117318854","https://openalex.org/W1590881797","https://openalex.org/W1601487505","https://openalex.org/W1918603512","https://openalex.org/W1963899113","https://openalex.org/W1971801736","https://openalex.org/W1977545325","https://openalex.org/W1990313671","https://openalex.org/W2001139415","https://openalex.org/W2002764437","https://openalex.org/W2003159902","https://openalex.org/W2007418721","https://openalex.org/W2011039300","https://openalex.org/W2011823863","https://openalex.org/W2014340938","https://openalex.org/W2022179164","https://openalex.org/W2022563199","https://openalex.org/W2034112563","https://openalex.org/W2059453880","https://openalex.org/W2066700938","https://openalex.org/W2079129721","https://openalex.org/W2088839217","https://openalex.org/W2150148016","https://openalex.org/W2340149117","https://openalex.org/W2602800732","https://openalex.org/W2752885492","https://openalex.org/W3099328339","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1972602069","https://openalex.org/W3047993683","https://openalex.org/W2776184136","https://openalex.org/W3092119098","https://openalex.org/W3117270560","https://openalex.org/W2982372708","https://openalex.org/W2963920438","https://openalex.org/W32827807","https://openalex.org/W3015300486","https://openalex.org/W1998141189"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}