{"id":"https://openalex.org/W2115616619","doi":"https://doi.org/10.1002/net.3230120309","title":"An algorithm for the steiner problem in graphs","display_name":"An algorithm for the steiner problem in graphs","publication_year":1982,"publication_date":"1982-09-01","ids":{"openalex":"https://openalex.org/W2115616619","doi":"https://doi.org/10.1002/net.3230120309","mag":"2115616619"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230120309","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230120309","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5074721307","display_name":"M. L. Shore","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"M. L. Shore","raw_affiliation_strings":["Ministry of Defense, New Zealand"],"affiliations":[{"raw_affiliation_string":"Ministry of Defense, New Zealand","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003787332","display_name":"L. R. Foulds","orcid":"https://orcid.org/0000-0001-7538-8263"},"institutions":[{"id":"https://openalex.org/I185492890","display_name":"University of Canterbury","ror":"https://ror.org/03y7q9t39","country_code":"NZ","type":"education","lineage":["https://openalex.org/I185492890"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"L. R. Foulds","raw_affiliation_strings":["University of Canterbury, New Zealand","University of Canterbury (New zealand)"],"affiliations":[{"raw_affiliation_string":"University of Canterbury, New Zealand","institution_ids":["https://openalex.org/I185492890"]},{"raw_affiliation_string":"University of Canterbury (New zealand)","institution_ids":["https://openalex.org/I185492890"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070988309","display_name":"Peter B. Gibbons","orcid":null},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"P. B. Gibbons","raw_affiliation_strings":["University of Auckland, New Zealand","University of Auckland NEW ZEALAND"],"affiliations":[{"raw_affiliation_string":"University of Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]},{"raw_affiliation_string":"University of Auckland NEW ZEALAND","institution_ids":["https://openalex.org/I154130895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5074721307"],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.606,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.84731986,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"12","issue":"3","first_page":"323","last_page":"333"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9955000281333923,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9955000281333923,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9829000234603882,"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.9818999767303467,"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.5991235375404358},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5226776003837585},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5181199908256531},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48680397868156433},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43598759174346924},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.433803915977478},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4205879867076874},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3447413146495819}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5991235375404358},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5226776003837585},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5181199908256531},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48680397868156433},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43598759174346924},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.433803915977478},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4205879867076874},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3447413146495819},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230120309","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230120309","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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":16,"referenced_works":["https://openalex.org/W1965680834","https://openalex.org/W1990488643","https://openalex.org/W1996668544","https://openalex.org/W2007572995","https://openalex.org/W2017927472","https://openalex.org/W2042477130","https://openalex.org/W2132087752","https://openalex.org/W2156503228","https://openalex.org/W2169528473","https://openalex.org/W2565132275","https://openalex.org/W3127447045","https://openalex.org/W3138807513","https://openalex.org/W4300778290","https://openalex.org/W4302399279","https://openalex.org/W6652428554","https://openalex.org/W6689124678"],"related_works":["https://openalex.org/W2161182859","https://openalex.org/W2118320476","https://openalex.org/W1503036335","https://openalex.org/W2025658531","https://openalex.org/W4244816249","https://openalex.org/W2115973883","https://openalex.org/W2739242419","https://openalex.org/W1585318792","https://openalex.org/W28092394","https://openalex.org/W3187836939"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"Steiner":[2],"problem":[3,37,47],"in":[4,25,48,54],"graphs":[5],"is":[6,38],"concerned":[7],"with":[8,14,41,65],"finding":[9],"a":[10,20,26,46],"set":[11],"of":[12,23,63,67],"edges":[13],"minimum":[15],"total":[16],"weight":[17],"which":[18],"connects":[19],"given":[21],"subset":[22],"points":[24],"weighted":[27],"graph.":[28],"A":[29],"branch":[30],"and":[31],"bound":[32],"algorithm":[33,57],"for":[34,60],"solving":[35],"this":[36],"presented":[39],"together":[40],"an":[42],"interesting":[43],"application":[44],"to":[45],"molecular":[49],"evolution.":[50],"Computational":[51],"experience":[52],"gained":[53],"using":[55],"the":[56],"compares":[58],"favorably,":[59],"certain":[61],"classes":[62],"graphs,":[64],"that":[66],"existing":[68],"methods.":[69]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}