{"id":"https://openalex.org/W2170398276","doi":"https://doi.org/10.1142/s0218195997000272","title":"Improved Computation of Optimal Rectilinear Steiner Minimal Trees","display_name":"Improved Computation of Optimal Rectilinear Steiner Minimal Trees","publication_year":1997,"publication_date":"1997-10-01","ids":{"openalex":"https://openalex.org/W2170398276","doi":"https://doi.org/10.1142/s0218195997000272","mag":"2170398276"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195997000272","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195997000272","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","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/A5049488583","display_name":"Joseph L. Ganley","orcid":null},"institutions":[{"id":"https://openalex.org/I66217453","display_name":"Cadence Design Systems (United States)","ror":"https://ror.org/04w8xa018","country_code":"US","type":"company","lineage":["https://openalex.org/I66217453"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Joseph L. Ganley","raw_affiliation_strings":["Cadence Design Systems, Inc., 555 River Oaks Parkway, San Jose, California 95134, USA"],"affiliations":[{"raw_affiliation_string":"Cadence Design Systems, Inc., 555 River Oaks Parkway, San Jose, California 95134, USA","institution_ids":["https://openalex.org/I66217453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114247262","display_name":"James P. Cohoon","orcid":null},"institutions":[{"id":"https://openalex.org/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James P. Cohoon","raw_affiliation_strings":["Department of Computer Science, University of Virginia, Charlottesville, Virginia 22903, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Virginia, Charlottesville, Virginia 22903, USA","institution_ids":["https://openalex.org/I51556381"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5049488583"],"corresponding_institution_ids":["https://openalex.org/I66217453"],"apc_list":null,"apc_paid":null,"fwci":2.6964,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.90089175,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"07","issue":"05","first_page":"457","last_page":"472"},"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.9995999932289124,"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.9995999932289124,"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9901000261306763,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9045360684394836},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6057416200637817},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5670375227928162},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5304702520370483},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5023455619812012},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4990196228027344},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45450809597969055},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.43007606267929077},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.42805594205856323},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4248073995113373},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.41862496733665466},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3385621905326843}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9045360684394836},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6057416200637817},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5670375227928162},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5304702520370483},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5023455619812012},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4990196228027344},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45450809597969055},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.43007606267929077},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.42805594205856323},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4248073995113373},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41862496733665466},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3385621905326843},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218195997000272","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195997000272","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2021517364","https://openalex.org/W1759995226","https://openalex.org/W2040347389","https://openalex.org/W4299305030","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W2089134982","https://openalex.org/W3100139999","https://openalex.org/W2113270940","https://openalex.org/W4252842032"],"abstract_inverted_index":{"This":[0],"paper":[1,125],"presents":[2],"two":[3],"new":[4],"algorithms":[5,117,133],"for":[6,134],"computing":[7,135],"optimal":[8,27,136],"rectilinear":[9,28,137],"Steiner":[10,29,138],"minimal":[11,30,139],"trees.":[12,140],"The":[13,40,64,124],"first":[14,46],"algorithm":[15,23,42,69],"is":[16,111],"a":[17,71,128],"simple,":[18],"easily":[19],"implemented":[20],"dynamic":[21],"programming":[22],"that":[24,73,113,115],"computes":[25],"an":[26],"tree":[31],"on":[32,84],"n":[33,37,61,80,85],"points":[34],"in":[35,55,120],"O(n3":[36],")":[38,62,81],"time.":[39,63],"second":[41,68],"improves":[43],"upon":[44],"the":[45,48,67,101,116],"using":[47],"concept":[49],"of":[50,66,105,131],"full-set":[51],"screening":[52],"and":[53],"runs":[54],"at":[56,76],"most":[57,77],"O(n":[58,78],"2":[59],"2.62":[60],"analysis":[65],"includes":[70,127],"proof":[72],"there":[74],"are":[75,97,118],"1.62":[79],"full":[82],"sets":[83],"terminals.":[86],"For":[87],"instances":[88],"small":[89],"enough":[90],"to":[91],"practically":[92],"solve,":[93],"these":[94],"time":[95],"bounds":[96,104],"provably":[98],"better":[99],"than":[100],"best":[102],"known":[103],"any":[106],"previous":[107,132],"algorithm.":[108],"Experimental":[109],"evidence":[110],"presented":[112],"demonstrates":[114],"fast":[119],"practice":[121],"as":[122],"well.":[123],"also":[126],"brief":[129],"survey":[130]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}