{"id":"https://openalex.org/W2044506432","doi":"https://doi.org/10.1002/net.3230200606","title":"A lower bound for the steiner tree problem in directed graphs","display_name":"A lower bound for the steiner tree problem in directed graphs","publication_year":1990,"publication_date":"1990-10-01","ids":{"openalex":"https://openalex.org/W2044506432","doi":"https://doi.org/10.1002/net.3230200606","mag":"2044506432"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230200606","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230200606","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/A5100620780","display_name":"Weiguo Liu","orcid":"https://orcid.org/0000-0003-4789-821X"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Weiguo Liu","raw_affiliation_strings":["Department of Electrical Engineering, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1","Dept. of Electrical Engineering University of Waterloo, Waterloo, Ontario, Canada N2L 3G1"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"Dept. of Electrical Engineering University of Waterloo, Waterloo, Ontario, Canada N2L 3G1","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100620780"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":2.0516,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.85547899,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"20","issue":"6","first_page":"765","last_page":"778"},"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.9991000294685364,"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.9991000294685364,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9854999780654907,"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/T10142","display_name":"Formal Methods in Verification","score":0.9817000031471252,"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.9280195832252502},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7211561799049377},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6535511016845703},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5048709511756897},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.4949435591697693},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4653658866882324},{"id":"https://openalex.org/keywords/ball","display_name":"Ball (mathematics)","score":0.46125471591949463},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4284519851207733},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40374958515167236},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2664812207221985}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9280195832252502},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7211561799049377},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6535511016845703},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5048709511756897},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.4949435591697693},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4653658866882324},{"id":"https://openalex.org/C122041747","wikidata":"https://www.wikidata.org/wiki/Q838611","display_name":"Ball (mathematics)","level":2,"score":0.46125471591949463},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4284519851207733},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40374958515167236},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2664812207221985},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230200606","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230200606","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1005876121","https://openalex.org/W1996668544","https://openalex.org/W2008771115","https://openalex.org/W2020586530","https://openalex.org/W2023521867","https://openalex.org/W2044121814","https://openalex.org/W2132087752","https://openalex.org/W2172222998","https://openalex.org/W2401610261","https://openalex.org/W4246185962","https://openalex.org/W6626306459"],"related_works":["https://openalex.org/W2118320476","https://openalex.org/W2916043681","https://openalex.org/W2161182859","https://openalex.org/W2896131632","https://openalex.org/W1503036335","https://openalex.org/W2025658531","https://openalex.org/W4244816249","https://openalex.org/W2115973883","https://openalex.org/W2228244008","https://openalex.org/W2301583490"],"abstract_inverted_index":{"Abstract":[0],"In":[1,133],"this":[2,68,103],"article,":[3],"we":[4,136],"introduce":[5],"a":[6,28,71,90,124,147],"new":[7,120],"integer":[8],"programming":[9,45],"formulation":[10,39,46,69,121],"for":[11,32,47,109,127],"the":[12,21,36,43,48,61,83,94,100,106,119,128,134,138],"minimum":[13,129],"Steiner":[14,25,30,51,85,130],"tree":[15,26,31,52,131],"problem":[16],"in":[17,159],"directed":[18],"graphs.":[19],"With":[20],"observation":[22],"that":[23,76],"every":[24,33],"contains":[27,70],"two\u2010terminal":[29],"pair":[34],"of":[35,63,74,93],"terminals,":[37],"our":[38],"is":[40,116],"based":[41],"on":[42],"linear":[44],"two":[49],"terminal":[50],"polyhedron":[53],"obtained":[54],"by":[55,82,143],"Ball":[56,64],"et":[57,65],"al.":[58,66],"[2].":[59],"By":[60],"results":[62,156],"[2],":[67],"large":[72],"class":[73],"facets":[75],"are":[77,157],"different":[78],"from":[79],"those":[80],"induced":[81],"well\u2010known":[84],"cut":[86],"constraints.":[87],"We":[88],"give":[89],"general":[91],"form":[92],"dual":[95,113,139],"ascent":[96,114,140],"algorithm":[97,104,115,141],"and":[98,105,149],"discuss":[99],"relationship":[101],"between":[102],"projection":[107],"method":[108],"extended":[110],"formulations.":[111],"This":[112],"applied":[117],"to":[118,122],"obtain":[123],"lower":[125,152],"bound":[126],"problem.":[132],"algorithm,":[135],"use":[137],"introduced":[142],"Wong":[144],"[16]":[145],"as":[146],"subroutine":[148],"improve":[150],"his":[151],"bound.":[153],"Some":[154],"computational":[155],"given":[158],"Section":[160],"3.":[161]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}