{"id":"https://openalex.org/W1990317614","doi":"https://doi.org/10.1016/0020-0190(88)90066-x","title":"A faster approximation algorithm for the Steiner problem in graphs","display_name":"A faster approximation algorithm for the Steiner problem in graphs","publication_year":1988,"publication_date":"1988-03-01","ids":{"openalex":"https://openalex.org/W1990317614","doi":"https://doi.org/10.1016/0020-0190(88)90066-x","mag":"1990317614"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(88)90066-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(88)90066-x","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5010961023","display_name":"Kurt Mehlhorn","orcid":"https://orcid.org/0000-0003-4020-4334"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Kurt Mehlhorn","raw_affiliation_strings":["Fachbereich 10\u2014Informatik, Universit\u00e4t des Saarlandes, D-6600 Saarbr\u00fccken, Germany, Fed. Rep. Germany","University of Saarlandes, Saarbru\u00a8cken, FRG#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fachbereich 10\u2014Informatik, Universit\u00e4t des Saarlandes, D-6600 Saarbr\u00fccken, Germany, Fed. Rep. Germany","institution_ids":["https://openalex.org/I91712215"]},{"raw_affiliation_string":"University of Saarlandes, Saarbru\u00a8cken, FRG#TAB#","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010961023"],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":6.9623,"has_fulltext":false,"cited_by_count":418,"citation_normalized_percentile":{"value":0.97200669,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"27","issue":"3","first_page":"125","last_page":"128"},"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.998199999332428,"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.9980000257492065,"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.939423680305481},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7885724902153015},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.644315779209137},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.545203447341919},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.529984712600708},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.506907045841217},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4860959053039551},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.44950070977211},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4408690929412842},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.42052802443504333},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.3294011950492859},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3230817914009094},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.19071710109710693},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.08410996198654175}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.939423680305481},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7885724902153015},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.644315779209137},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.545203447341919},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.529984712600708},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.506907045841217},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4860959053039551},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.44950070977211},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4408690929412842},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.42052802443504333},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.3294011950492859},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3230817914009094},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.19071710109710693},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.08410996198654175}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1016/0020-0190(88)90066-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(88)90066-x","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:edoc.mpg.de:344570","is_oa":false,"landing_page_url":"http://edoc.mpg.de/344570","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":"Information Processing Letters, v.27, 125-128 (1988)","raw_type":"Article"},{"id":"pmh:oai:edoc.mpg.de:344623","is_oa":false,"landing_page_url":"http://edoc.mpg.de/344623","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":"","raw_type":"Other"},{"id":"pmh:oai:pure.mpg.de:item_1332100","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0014-AE82-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":"Information Processing Letters","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.mpg.de:item_1332122","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0014-AEAE-F","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":null,"raw_type":"info:eu-repo/semantics/other"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1975290397","https://openalex.org/W1993553699","https://openalex.org/W2084224084","https://openalex.org/W2086709935","https://openalex.org/W3127447045","https://openalex.org/W6789680617"],"related_works":["https://openalex.org/W2183636263","https://openalex.org/W2943635264","https://openalex.org/W620960161","https://openalex.org/W1595291551","https://openalex.org/W974563791","https://openalex.org/W4239736023","https://openalex.org/W2999680961","https://openalex.org/W130518292","https://openalex.org/W2911818503","https://openalex.org/W1754127855"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":16},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":16},{"year":2015,"cited_by_count":16},{"year":2014,"cited_by_count":23},{"year":2013,"cited_by_count":25},{"year":2012,"cited_by_count":26}],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2025-10-10T00:00:00"}