{"id":"https://openalex.org/W2065371968","doi":"https://doi.org/10.1002/(sici)1097-0037(199801)31:1<11::aid-net2>3.0.co;2-n","title":"A strong lower bound for the Node Weighted Steiner Tree Problem","display_name":"A strong lower bound for the Node Weighted Steiner Tree Problem","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2065371968","doi":"https://doi.org/10.1002/(sici)1097-0037(199801)31:1<11::aid-net2>3.0.co;2-n","mag":"2065371968"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0037(199801)31:1<11::aid-net2>3.0.co;2-n","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199801)31:1<11::aid-net2>3.0.co;2-n","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/A5027361574","display_name":"Stefan Engevall","orcid":"https://orcid.org/0000-0001-7915-9038"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Stefan Engevall","raw_affiliation_strings":["Department of Mathematics, Linko\u0308ping Institute of Technology, S-581 83 Linko\u0308ping, Sweden","Department of Mathematics, Link\u00f6ping Institute of Technology, S\u2010581 83 Link\u00f6ping, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Linko\u0308ping Institute of Technology, S-581 83 Linko\u0308ping, Sweden","institution_ids":["https://openalex.org/I102134673"]},{"raw_affiliation_string":"Department of Mathematics, Link\u00f6ping Institute of Technology, S\u2010581 83 Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5097774647","display_name":"Maud G\ufffdthe-Lundgren","orcid":null},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Maud G\ufffdthe-Lundgren","raw_affiliation_strings":["Department of Mathematics, Link\u00f6ping Institute of Technology, S\u2010581 83 Link\u00f6ping, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Link\u00f6ping Institute of Technology, S\u2010581 83 Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5096919850","display_name":"Peter V\ufffdrbrand","orcid":null},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Peter V\ufffdrbrand","raw_affiliation_strings":["Department of Mathematics, Link\u00f6ping Institute of Technology, S\u2010581 83 Link\u00f6ping, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Link\u00f6ping Institute of Technology, S\u2010581 83 Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5027361574"],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.5685,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.82393477,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"31","issue":"1","first_page":"11","last_page":"17"},"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.9854000210762024,"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.9854000210762024,"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.9656999707221985,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9406999945640564,"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.8423621654510498},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7069607377052307},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6677509546279907},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6550255417823792},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5359991192817688},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5312203168869019},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4739401638507843},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44127726554870605},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4378528594970703},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4171186685562134},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3857537806034088},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.280262291431427}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8423621654510498},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7069607377052307},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6677509546279907},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6550255417823792},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5359991192817688},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5312203168869019},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4739401638507843},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44127726554870605},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4378528594970703},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4171186685562134},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3857537806034088},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.280262291431427},{"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/(sici)1097-0037(199801)31:1<11::aid-net2>3.0.co;2-n","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199801)31:1<11::aid-net2>3.0.co;2-n","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":0,"referenced_works":[],"related_works":["https://openalex.org/W3047993683","https://openalex.org/W4385970294","https://openalex.org/W2090953203","https://openalex.org/W1972602069","https://openalex.org/W3194189065","https://openalex.org/W2239921431","https://openalex.org/W1861445996","https://openalex.org/W2059680011","https://openalex.org/W2905721092","https://openalex.org/W32827807"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"study":[4],"the":[5,18,23,34,46,52,57,83,102],"Node":[6],"Weighted":[7],"Steiner":[8,19],"Tree":[9],"Problem":[10],"(NSP).":[11],"This":[12],"problem":[13,21,35],"is":[14,36,49,61,98],"a":[15,39,43,65,72,79,90],"generalization":[16],"of":[17,45,68,93],"tree":[20,40],"in":[22],"sense":[24],"that":[25,41,51],"vertex":[26,59],"weights":[27],"are":[28,87],"considered.":[29],"Given":[30],"an":[31],"undirected":[32],"graph,":[33],"to":[37],"find":[38],"spans":[42],"subset":[44],"vertices":[47],"and":[48,70,96],"such":[50],"total":[53,58],"edge":[54],"cost":[55],"minus":[56],"weight":[60],"minimized.":[62],"We":[63],"present":[64],"new":[66],"formulation":[67],"NSP":[69],"derive":[71],"Lagrangean":[73],"bound":[74],"which":[75],"used":[76],"together":[77],"with":[78],"heuristic":[80],"procedure":[81],"solves":[82],"NSP.":[84],"Computational":[85],"results":[86],"reported":[88],"on":[89],"large":[91],"set":[92],"test":[94],"problems":[95],"optimality":[97],"proven":[99],"for":[100],"all":[101],"generated":[103],"instances.":[104],"\u00a9":[105],"1998":[106,115],"John":[107],"Wiley":[108],"&":[109],"Sons,":[110],"Inc.":[111],"Networks":[112],"31:":[113],"11\u201317,":[114]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}