{"id":"https://openalex.org/W1522776502","doi":"https://doi.org/10.1090/dimacs/040/21","title":"A new exact algorithm for rectilinear Steiner trees","display_name":"A new exact algorithm for rectilinear Steiner trees","publication_year":1998,"publication_date":"1998-03-03","ids":{"openalex":"https://openalex.org/W1522776502","doi":"https://doi.org/10.1090/dimacs/040/21","mag":"1522776502"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/040/21","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/040/21","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"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/A5054128138","display_name":"David M. Warme","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"David Warme","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5054128138"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.3869,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.95827286,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"357","last_page":"395"},"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.9643999934196472,"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.9643999934196472,"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/T10142","display_name":"Formal Methods in Verification","score":0.9128999710083008,"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.8538209199905396},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5333179235458374},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4477696716785431},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44456642866134644},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39558491110801697}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8538209199905396},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5333179235458374},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4477696716785431},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44456642866134644},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39558491110801697}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1090/dimacs/040/21","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/040/21","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.38.8703","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.8703","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.s3i.com/~warme/pubs/informs_san_diego.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.53.9825","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.9825","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.s3i.com/~warme/pubs/ismp97.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.57.761","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.761","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.s3i.com/~warme/pubs/ismp97a.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6299999952316284,"id":"https://metadata.un.org/sdg/2","display_name":"Zero hunger"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2020112047","https://openalex.org/W2041044701","https://openalex.org/W2182638969","https://openalex.org/W1511806935","https://openalex.org/W2587866457","https://openalex.org/W68185083","https://openalex.org/W2083481972","https://openalex.org/W3105668836","https://openalex.org/W120709761","https://openalex.org/W174241252","https://openalex.org/W2086709935","https://openalex.org/W2069712919","https://openalex.org/W2064086982","https://openalex.org/W1986920692","https://openalex.org/W3010770967","https://openalex.org/W2287481711","https://openalex.org/W2488261716","https://openalex.org/W1489753742","https://openalex.org/W1989337351","https://openalex.org/W2162448223"],"abstract_inverted_index":{"Given":[0],"a":[1,18,74,87,95,97,132,159],"finite":[2],"set":[3,75],"V":[4,31],"of":[5,21,30,36,76,101],"points":[6],"in":[7,112],"the":[8,12,28,58,63,82,102,125],"plane":[9],"(called":[10],"terminals),":[11],"rectilinear":[13],"Steiner":[14,55,78,88],"minimal":[15,89,98],"tree":[16,90],"is":[17,49,70,91],"shortest":[19],"network":[20],"horizontal":[22],"and":[23,131],"vertical":[24],"lines":[25],"connecting":[26],"all":[27,115],"terminals":[29],".":[32],"The":[33],"decision":[34],"form":[35],"this":[37],"problem":[38,128,140],"has":[39,108],"been":[40,109],"shown":[41],"to":[42,72,136,144],"be":[43,152],"NP-complete":[44],"[8].":[45],"A":[46],"new":[47],"algorithm":[48],"presented":[50],"that":[51],"computes":[52],"provably":[53],"optimal":[54],"trees":[56,79],"using":[57],""FST":[59,64],"concatenation"":[60],"approach.":[61],"In":[62,81,120],"generation"":[65],"phase,":[66,86],"extensive":[67],"geometric":[68],"processing":[69],"used":[71,127],"identify":[73],"full":[77],"(FSTs).":[80],"subsequent":[83],"FST":[84,105],"concatenation":[85,106],"then":[92],"constructed":[93],"by":[94],"finding":[96],"spanning":[99],"subset":[100],"FSTs.":[103],"This":[104],"approach":[107],"more":[110],"efficient":[111],"practice":[113],"than":[114],"other":[116],"methods":[117,130],"currently":[118],"known.":[119],"previous":[121],"work":[122],"[19],":[123],"[20]":[124],"author":[126],"decomposition":[129],""dumb"":[133],"backtrack":[134],"search":[135],"concatenate":[137],"FSTs,":[138],"solving":[139],"instances":[141,150],"with":[142],"up":[143],"65":[145],"terminals.":[146],"Most":[147],"45":[148],"point":[149],"could":[151],"solved":[153],"within":[154],"one":[155],"CPU":[156],"day":[157],"on":[158],"worksta...":[160]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2016-06-24T00:00:00"}