{"id":"https://openalex.org/W1485792125","doi":"https://doi.org/10.1007/bfb0023489","title":"RNC-approximation algorithms for the steiner problem","display_name":"RNC-approximation algorithms for the steiner problem","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W1485792125","doi":"https://doi.org/10.1007/bfb0023489","mag":"1485792125"},"language":"en","primary_location":{"id":"doi:10.1007/bfb0023489","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0023489","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/A5072637221","display_name":"Hans J\u00fcrgen Pr\u00f6mel","orcid":null},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Hans J\u00fcrgen Pr\u00f6mel","raw_affiliation_strings":["Institut f\u00fcr Informatik, Humboldt Universit\u00e4t zu Berlin, 10099, Berlin, Germany","Humboldt Universit\u00e1t zu Berlin"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Humboldt Universit\u00e4t zu Berlin, 10099, Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]},{"raw_affiliation_string":"Humboldt Universit\u00e1t zu Berlin","institution_ids":["https://openalex.org/I39343248"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062687538","display_name":"Angelika Steger","orcid":"https://orcid.org/0000-0002-3465-3996"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Angelika Steger","raw_affiliation_strings":["Institut f\u00fcr Informatik, TU M\u00fcnchen, 80290, M\u00fcnchen, Germany","TU-M\u00fcnchen#TAB#"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, TU M\u00fcnchen, 80290, M\u00fcnchen, Germany","institution_ids":[]},{"raw_affiliation_string":"TU-M\u00fcnchen#TAB#","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5072637221"],"corresponding_institution_ids":["https://openalex.org/I39343248"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.5932,"has_fulltext":false,"cited_by_count":51,"citation_normalized_percentile":{"value":0.91334895,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"559","last_page":"570"},"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.9995999932289124,"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.9995999932289124,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9973999857902527,"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.7986388206481934},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.791053831577301},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.45335307717323303},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43246525526046753},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3130625784397125},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16180261969566345}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7986388206481934},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.791053831577301},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45335307717323303},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43246525526046753},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3130625784397125},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16180261969566345}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/bfb0023489","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0023489","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.45.3754","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.3754","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.leo.org/pub/comp/doc/techreports/tum/informatik/report/1996/TUM-I9633.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.6.8875","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.8875","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://wwwmayr.informatik.tu-muenchen.de/berichte/1996/tum-i9633.ps.gz","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":24,"referenced_works":["https://openalex.org/W15553240","https://openalex.org/W109985799","https://openalex.org/W1531591475","https://openalex.org/W1535706250","https://openalex.org/W1970630246","https://openalex.org/W1975290397","https://openalex.org/W1975442866","https://openalex.org/W1979740015","https://openalex.org/W1981234161","https://openalex.org/W1988698339","https://openalex.org/W1996668544","https://openalex.org/W1997126046","https://openalex.org/W2003882909","https://openalex.org/W2012130001","https://openalex.org/W2031297526","https://openalex.org/W2070664846","https://openalex.org/W2080063509","https://openalex.org/W2113906664","https://openalex.org/W2143391442","https://openalex.org/W2157338118","https://openalex.org/W2401610261","https://openalex.org/W2586554544","https://openalex.org/W2610479830","https://openalex.org/W3127447045"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W3184075718","https://openalex.org/W328736688","https://openalex.org/W2331728693","https://openalex.org/W2404561224","https://openalex.org/W1533142511","https://openalex.org/W2900469667","https://openalex.org/W2963258629","https://openalex.org/W2139657917"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}