{"id":"https://openalex.org/W2031493401","doi":"https://doi.org/10.1002/net.3230200110","title":"Faster exact algorithms for steiner trees in planar networks","display_name":"Faster exact algorithms for steiner trees in planar networks","publication_year":1990,"publication_date":"1990-01-01","ids":{"openalex":"https://openalex.org/W2031493401","doi":"https://doi.org/10.1002/net.3230200110","mag":"2031493401"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230200110","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230200110","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/A5056449861","display_name":"Marshall Bern","orcid":"https://orcid.org/0000-0003-0342-9390"},"institutions":[{"id":"https://openalex.org/I173498003","display_name":"Palo Alto Research Center","ror":"https://ror.org/0529fxt39","country_code":"US","type":"facility","lineage":["https://openalex.org/I173498003","https://openalex.org/I4210132870"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Marshall Bern","raw_affiliation_strings":["Xerox Palo Alto Research Center, Palo Alto, California 94304","Xerox Palo Alto Research Center Palo Alto, California 94304"],"affiliations":[{"raw_affiliation_string":"Xerox Palo Alto Research Center, Palo Alto, California 94304","institution_ids":["https://openalex.org/I173498003"]},{"raw_affiliation_string":"Xerox Palo Alto Research Center Palo Alto, California 94304","institution_ids":["https://openalex.org/I173498003"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056449861"],"corresponding_institution_ids":["https://openalex.org/I173498003"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":4.1637,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.93319854,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"20","issue":"1","first_page":"109","last_page":"120"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9997000098228455,"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.9975000023841858,"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.9966999888420105,"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.9527579545974731},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.6705304980278015},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6231005191802979},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6225787401199341},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5388161540031433},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4873810410499573},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.44608181715011597},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43494126200675964},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3454596996307373},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15051361918449402}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9527579545974731},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.6705304980278015},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6231005191802979},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6225787401199341},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5388161540031433},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4873810410499573},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.44608181715011597},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43494126200675964},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3454596996307373},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15051361918449402},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230200110","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230200110","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/W1992963068","https://openalex.org/W1996668544","https://openalex.org/W2011039300","https://openalex.org/W2040444410","https://openalex.org/W2053439155","https://openalex.org/W2064086982","https://openalex.org/W2070164574","https://openalex.org/W2084224084","https://openalex.org/W2115616619","https://openalex.org/W2120424341","https://openalex.org/W2125690626","https://openalex.org/W2150855695","https://openalex.org/W2163668690","https://openalex.org/W2172222998","https://openalex.org/W2405045331","https://openalex.org/W3148632216"],"related_works":["https://openalex.org/W2118320476","https://openalex.org/W2161182859","https://openalex.org/W1503036335","https://openalex.org/W2025658531","https://openalex.org/W4244816249","https://openalex.org/W2115973883","https://openalex.org/W2739242419","https://openalex.org/W3216105633","https://openalex.org/W2108770488","https://openalex.org/W2990956612"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"improve":[2],"the":[3,28],"time":[4],"and":[5],"space":[6],"complexities":[7],"of":[8],"dynamic":[9],"programming":[10],"algorithms":[11,23],"that":[12],"compute":[13],"optimal":[14],"Steiner":[15,30],"trees":[16],"spanning":[17],"nodes":[18],"in":[19],"planar":[20],"networks.":[21],"Our":[22],"have":[24],"special":[25],"application":[26],"to":[27],"rectilinear":[29],"problem.":[31]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}