{"id":"https://openalex.org/W2165571569","doi":"https://doi.org/10.1007/3-540-44436-x_22","title":"Primal-Dual Approaches to the Steiner Problem","display_name":"Primal-Dual Approaches to the Steiner Problem","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2165571569","doi":"https://doi.org/10.1007/3-540-44436-x_22","mag":"2165571569"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44436-x_22","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44436-x_22","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":"conference-paper","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/A5066395615","display_name":"Tobias Polzin","orcid":null},"institutions":[{"id":"https://openalex.org/I177802217","display_name":"University of Mannheim","ror":"https://ror.org/031bsb921","country_code":"DE","type":"education","lineage":["https://openalex.org/I177802217"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tobias Polzin","raw_affiliation_strings":["Theoretische Informatik, Universit\u00e4t Mannheim, 68131, Mannheim, Germany","Universit\u00e4t Mannheim"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Theoretische Informatik, Universit\u00e4t Mannheim, 68131, Mannheim, Germany","institution_ids":["https://openalex.org/I177802217"]},{"raw_affiliation_string":"Universit\u00e4t Mannheim","institution_ids":["https://openalex.org/I177802217"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010040559","display_name":"Siavash Vahdati Daneshmand","orcid":null},"institutions":[{"id":"https://openalex.org/I177802217","display_name":"University of Mannheim","ror":"https://ror.org/031bsb921","country_code":"DE","type":"education","lineage":["https://openalex.org/I177802217"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Siavash Vahdati","raw_affiliation_strings":["Theoretische Informatik, Universit\u00e4t Mannheim, 68131, Mannheim, Germany","Universit\u00e4t Mannheim"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Theoretische Informatik, Universit\u00e4t Mannheim, 68131, Mannheim, Germany","institution_ids":["https://openalex.org/I177802217"]},{"raw_affiliation_string":"Universit\u00e4t Mannheim","institution_ids":["https://openalex.org/I177802217"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I177802217"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"7","issue":null,"first_page":"214","last_page":"225"},"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.9987999796867371,"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.9987999796867371,"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.9984999895095825,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9965999722480774,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7171287536621094},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.6393212080001831},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.6103128790855408},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6072230935096741},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5676433444023132},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5437941551208496},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5426639914512634},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5147235989570618},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5115867257118225},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4174948036670685},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3997770845890045},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3430076837539673}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7171287536621094},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.6393212080001831},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.6103128790855408},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6072230935096741},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5676433444023132},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5437941551208496},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5426639914512634},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5147235989570618},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5115867257118225},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4174948036670685},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3997770845890045},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3430076837539673},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1007/3-540-44436-x_22","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44436-x_22","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:ub-madoc.bib.uni-mannheim.de:1842","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196315","display_name":"MADOC (University of Mannheim)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177802217","host_organization_name":"University of Mannheim","host_organization_lineage":["https://openalex.org/I177802217"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Arbeitspapier"},{"id":"pmh:oai:MAUB:1842","is_oa":false,"landing_page_url":"http://madoc.bib.uni-mannheim.de/madoc/volltexte/2008/1842/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401433","display_name":"MADOC (University of Mannheim)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177802217","host_organization_name":"University of Mannheim","host_organization_lineage":["https://openalex.org/I177802217"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Technical Report / Department for Mathematics and Computer Science, University of Mannheim ; TR-2000-014","raw_type":"ResearchPaper"},{"id":"pmh:oai:edoc.mpg.de:518185","is_oa":false,"landing_page_url":"http://edoc.mpg.de/518185","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","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":"Jansen, Klaus; Khuller, Samir: Approximation Algorithms for Combinatorial Optimization, Springer, 214-225 (2000)","raw_type":"Conference-Paper"},{"id":"pmh:oai:pure.mpg.de:item_1330884","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-33F1-D","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"mag:2165571569","is_oa":false,"landing_page_url":"http://eccc.hpi-web.de/eccc-reports/2000/TR00-047/index.html","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null},{"id":"mag:2492603257","is_oa":false,"landing_page_url":"http://pubman.mpdl.mpg.de/pubman/item/escidoc:1330884","pdf_url":null,"source":{"id":"https://openalex.org/S4306533943","display_name":"Untitled Event","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Untitled Event","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1544515183","https://openalex.org/W1965229006","https://openalex.org/W1974745840","https://openalex.org/W1990317614","https://openalex.org/W2001139415","https://openalex.org/W2004305790","https://openalex.org/W2007503572","https://openalex.org/W2008534472","https://openalex.org/W2020163691","https://openalex.org/W2020586530","https://openalex.org/W2068799282","https://openalex.org/W2117754372","https://openalex.org/W2117937654","https://openalex.org/W2119918317","https://openalex.org/W2155239253","https://openalex.org/W2164245156","https://openalex.org/W2277622081","https://openalex.org/W2752885492","https://openalex.org/W3021678318","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W2492603257","https://openalex.org/W1897679864","https://openalex.org/W2949621372","https://openalex.org/W2081379545","https://openalex.org/W2581308051","https://openalex.org/W2770859661","https://openalex.org/W2065240689","https://openalex.org/W3131735012","https://openalex.org/W1945544174","https://openalex.org/W2551743513","https://openalex.org/W2542610836","https://openalex.org/W2768675866","https://openalex.org/W2973908270","https://openalex.org/W2406356034","https://openalex.org/W1965859959","https://openalex.org/W2965157832","https://openalex.org/W242735627","https://openalex.org/W2950199409","https://openalex.org/W1663464721","https://openalex.org/W2544332808"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}