{"id":"https://openalex.org/W3015300486","doi":"https://doi.org/10.1007/978-1-4020-9688-4_9","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":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W3015300486","doi":"https://doi.org/10.1007/978-1-4020-9688-4_9","mag":"3015300486"},"language":"en","primary_location":{"id":"doi:10.1007/978-1-4020-9688-4_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-1-4020-9688-4_9","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamental Problems in Computing","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/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"],"affiliations":[{"raw_affiliation_string":"Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA, 15213-3890, USA","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":"Madhav V. Marathe","raw_affiliation_strings":["Los Alamos National Laboratory, P.O. Box 1663, MS B265, Los Alamos, NM, 87545, USA"],"affiliations":[{"raw_affiliation_string":"Los Alamos National Laboratory, P.O. Box 1663, MS B265, Los Alamos, NM, 87545, USA","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 at Albany\u2014SUNY, 1400 Washington Avenue, Albany, NY, 12222, USA","Department of Computer Science, University at Albany\u2014SUNY, Albany, NY, 12222, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University at Albany\u2014SUNY, 1400 Washington Avenue, Albany, NY, 12222, USA","institution_ids":["https://openalex.org/I392282"]},{"raw_affiliation_string":"Department of Computer Science, University at Albany\u2014SUNY, Albany, NY, 12222, USA","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":"Daniel J. Rosenkrantz","raw_affiliation_strings":["Department of Computer Science, University at Albany\u2014SUNY, Albany, NY, 12222, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University at Albany\u2014SUNY, Albany, NY, 12222, USA","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":"Harry B. Hunt","raw_affiliation_strings":["Department of Computer Science, University at Albany\u2014SUNY, Albany, NY, 12222, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University at Albany\u2014SUNY, Albany, NY, 12222, USA","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":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34928822,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"241","last_page":"266"},"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.9993000030517578,"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.9993000030517578,"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.9970999956130981,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9940999746322632,"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.8601038455963135},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.8141781091690063},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7160347700119019},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6572269797325134},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5889050364494324},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5336257815361023},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.518809974193573},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5075937509536743},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4900630712509155},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48793527483940125},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4753296673297882},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4565649926662445},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.43620240688323975}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8601038455963135},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.8141781091690063},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7160347700119019},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6572269797325134},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5889050364494324},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5336257815361023},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.518809974193573},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5075937509536743},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4900630712509155},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48793527483940125},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4753296673297882},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4565649926662445},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.43620240688323975},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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":1,"locations":[{"id":"doi:10.1007/978-1-4020-9688-4_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-1-4020-9688-4_9","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamental Problems in Computing","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1577011462","https://openalex.org/W1590881797","https://openalex.org/W1601487505","https://openalex.org/W1963899113","https://openalex.org/W1971801736","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/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/W2167579893","https://openalex.org/W2602800732","https://openalex.org/W2752885492","https://openalex.org/W2956015669","https://openalex.org/W3099328339","https://openalex.org/W6722013168","https://openalex.org/W7026635939","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W2004321562","https://openalex.org/W3184075718","https://openalex.org/W328736688","https://openalex.org/W2995411114","https://openalex.org/W2404561224"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}