{"id":"https://openalex.org/W1608030126","doi":"https://doi.org/10.1007/s12532-016-0110-1","title":"Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm","display_name":"Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm","publication_year":2016,"publication_date":"2016-07-14","ids":{"openalex":"https://openalex.org/W1608030126","doi":"https://doi.org/10.1007/s12532-016-0110-1","mag":"1608030126"},"language":"en","primary_location":{"id":"doi:10.1007/s12532-016-0110-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12532-016-0110-1","pdf_url":null,"source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"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":"Mathematical Programming Computation","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/A5085228445","display_name":"Stefan Hougardy","orcid":"https://orcid.org/0000-0001-8656-3418"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Hougardy","raw_affiliation_strings":["Research Institute for Discrete Mathematics, University of Bonn, Bonn, Germany","University of Bonn"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Institute for Discrete Mathematics, University of Bonn, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]},{"raw_affiliation_string":"University of Bonn","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063229918","display_name":"Jannik Silvanus","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Jannik Silvanus","raw_affiliation_strings":["Research Institute for Discrete Mathematics, University of Bonn, Bonn, Germany","University of Bonn"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Institute for Discrete Mathematics, University of Bonn, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]},{"raw_affiliation_string":"University of Bonn","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028076811","display_name":"Jens Vygen","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jens Vygen","raw_affiliation_strings":["Research Institute for Discrete Mathematics, University of Bonn, Bonn, Germany","University of Bonn"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Institute for Discrete Mathematics, University of Bonn, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]},{"raw_affiliation_string":"University of Bonn","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5063229918"],"corresponding_institution_ids":["https://openalex.org/I135140700"],"apc_list":{"value":3090,"currency":"USD","value_usd":3090},"apc_paid":null,"fwci":4.5648,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.94625812,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"9","issue":"2","first_page":"135","last_page":"202"},"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.9997000098228455,"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.9997000098228455,"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.9994999766349792,"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.9994000196456909,"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.9483378529548645},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8528786897659302},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.6852573156356812},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.638342022895813},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6131026148796082},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5817177891731262},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5549962520599365},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5460994839668274},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5108546614646912},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5103663802146912},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.475463330745697},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42439407110214233},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40413811802864075},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3096592426300049},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.26639026403427124},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.24895477294921875},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12642627954483032},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09981173276901245}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9483378529548645},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8528786897659302},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6852573156356812},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.638342022895813},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6131026148796082},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5817177891731262},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5549962520599365},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5460994839668274},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5108546614646912},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5103663802146912},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.475463330745697},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42439407110214233},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40413811802864075},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3096592426300049},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26639026403427124},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.24895477294921875},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12642627954483032},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09981173276901245},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s12532-016-0110-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12532-016-0110-1","pdf_url":null,"source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"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":"Mathematical Programming Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W124060458","https://openalex.org/W592802526","https://openalex.org/W1508240458","https://openalex.org/W1747960360","https://openalex.org/W1969186119","https://openalex.org/W1969483458","https://openalex.org/W1976584101","https://openalex.org/W1996668544","https://openalex.org/W2003753063","https://openalex.org/W2004092973","https://openalex.org/W2008534472","https://openalex.org/W2008771115","https://openalex.org/W2009803313","https://openalex.org/W2017927472","https://openalex.org/W2020586530","https://openalex.org/W2027515293","https://openalex.org/W2039298646","https://openalex.org/W2039706936","https://openalex.org/W2064086982","https://openalex.org/W2069712919","https://openalex.org/W2078404396","https://openalex.org/W2084224084","https://openalex.org/W2093399914","https://openalex.org/W2139888361","https://openalex.org/W2147534455","https://openalex.org/W2150855695","https://openalex.org/W2155239253","https://openalex.org/W2164245156","https://openalex.org/W2169528473","https://openalex.org/W2180988813","https://openalex.org/W2189656425","https://openalex.org/W2396572025","https://openalex.org/W2401610261","https://openalex.org/W2500374022","https://openalex.org/W2601582571","https://openalex.org/W3149604617","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4298026806","https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W2990531685","https://openalex.org/W4310124294"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3}],"updated_date":"2026-07-25T09:21:30.201066","created_date":"2025-10-10T00:00:00"}