{"id":"https://openalex.org/W2800659169","doi":"https://doi.org/10.1002/net.21825","title":"Algorithms for node\u2010weighted Steiner tree and maximum\u2010weight connected subgraph","display_name":"Algorithms for node\u2010weighted Steiner tree and maximum\u2010weight connected subgraph","publication_year":2018,"publication_date":"2018-04-23","ids":{"openalex":"https://openalex.org/W2800659169","doi":"https://doi.org/10.1002/net.21825","mag":"2800659169"},"language":"en","primary_location":{"id":"doi:10.1002/net.21825","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.21825","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/A5006813161","display_name":"Austin Buchanan","orcid":"https://orcid.org/0000-0003-2999-9666"},"institutions":[{"id":"https://openalex.org/I115475287","display_name":"Oklahoma State University","ror":"https://ror.org/01g9vbr38","country_code":"US","type":"education","lineage":["https://openalex.org/I115475287"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Austin Buchanan","raw_affiliation_strings":["Industrial Engineering & Management Oklahoma State University Stillwater"],"raw_orcid":"https://orcid.org/0000-0003-2999-9666","affiliations":[{"raw_affiliation_string":"Industrial Engineering & Management Oklahoma State University Stillwater","institution_ids":["https://openalex.org/I115475287"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100377935","display_name":"Yiming Wang","orcid":"https://orcid.org/0000-0002-5932-4371"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yiming Wang","raw_affiliation_strings":["Industrial and Systems Engineering Texas A&M University College Station"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Industrial and Systems Engineering Texas A&M University College Station","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029500446","display_name":"Sergiy Butenko","orcid":"https://orcid.org/0000-0002-6662-9552"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sergiy Butenko","raw_affiliation_strings":["Industrial and Systems Engineering Texas A&M University College Station"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Industrial and Systems Engineering Texas A&M University College Station","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5006813161"],"corresponding_institution_ids":["https://openalex.org/I115475287"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.2824,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.81886905,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"72","issue":"2","first_page":"238","last_page":"248"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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/T12029","display_name":"DNA and Biological Computing","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8706914186477661},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6356773376464844},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5620276927947998},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5567721724510193},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5528181195259094},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5446038842201233},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5276790261268616},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5044986009597778},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4355509877204895},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.43091192841529846},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41874125599861145},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40012338757514954},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3866834044456482},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.3831820785999298},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.14839321374893188},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.12699192762374878}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8706914186477661},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6356773376464844},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5620276927947998},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5567721724510193},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5528181195259094},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5446038842201233},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5276790261268616},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5044986009597778},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4355509877204895},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.43091192841529846},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41874125599861145},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40012338757514954},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3866834044456482},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.3831820785999298},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.14839321374893188},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.12699192762374878},{"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.21825","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.21825","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":[{"id":"https://openalex.org/G2772280207","display_name":null,"funder_award_id":"1662757","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2975157516","display_name":null,"funder_award_id":"1538493","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W55191700","https://openalex.org/W201760388","https://openalex.org/W1579272824","https://openalex.org/W1985572324","https://openalex.org/W1996668544","https://openalex.org/W2003753063","https://openalex.org/W2012329067","https://openalex.org/W2012948111","https://openalex.org/W2020112047","https://openalex.org/W2059387708","https://openalex.org/W2125690626","https://openalex.org/W2132087752","https://openalex.org/W2139087151","https://openalex.org/W2140951480","https://openalex.org/W2148043549","https://openalex.org/W2171662214","https://openalex.org/W2172222998","https://openalex.org/W2249739104","https://openalex.org/W2401610261","https://openalex.org/W2522051431","https://openalex.org/W2586469794","https://openalex.org/W2913688336","https://openalex.org/W4242301326","https://openalex.org/W4256418102","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W3047993683","https://openalex.org/W2090953203","https://openalex.org/W1524393328","https://openalex.org/W4293583696","https://openalex.org/W2953071209","https://openalex.org/W2030879379","https://openalex.org/W2062226917","https://openalex.org/W1985149601","https://openalex.org/W2203860513","https://openalex.org/W2800659169"],"abstract_inverted_index":{"This":[0],"article":[1],"considers":[2],"the":[3,10,20,26,52,104,122,127,132,164,167,172,179],"node\u2010weighted":[4],"Steiner":[5,67,98],"tree":[6,68,79,99],"(NWST)":[7],"problem":[8],"and":[9,25,64,72],"maximum\u2010weight":[11],"connected":[12],"subgraph":[13],"(MWCS)":[14],"problem,":[15],"which":[16],"have":[17,137],"applications":[18],"in":[19,45,121,131,160,178],"design":[21],"of":[22,28,54,70,124,126,134,166],"telecommunication":[23],"networks":[24],"analysis":[27],"biological":[29],"networks.":[30],"Exact":[31],"algorithms":[32,112],"with":[33],"provable":[34],"worst\u2010case":[35],"runtimes":[36,118],"are":[37,115,119,171],"provided.":[38,116],"The":[39,142],"first":[40,173],"algorithm":[41,69,86,96],"for":[42,47,87,97,113],"NWST":[43],"runs":[44],"time":[46,85,107,161],"n":[48],"\u2010vertex":[49],"instances":[50],"when":[51],"number":[53,123,133],"terminals":[55],"is":[56,59,90,100,144],"bounded.":[57],"It":[58,89],"based":[60],"on":[61],"dynamic":[62],"programming":[63],"generalizes":[65],"a":[66,84],"Dreyfus":[71],"Wagner.":[73],"When":[74],"used":[75],"alongside":[76],"Hakimi's":[77,94],"spanning":[78],"enumeration":[80],"algorithm,":[81],"it":[82],"implies":[83],"NWST.":[88],"also":[91],"shown":[92,145],"that":[93,136,155],"46\u2010year\u2010old":[95],"essentially":[101,148],"best\u2010possible":[102,149],"under":[103,150],"strong":[105],"exponential":[106,130],"hypothesis":[108],"(SETH).":[109],"Then":[110],"two":[111],"MWCS":[114,156],"Their":[117],"polynomial":[120],"vertices":[125,135],"graph,":[128],"but":[129],"positive":[138],"(or":[139],"negative)":[140],"weight.":[141],"latter":[143],"to":[146],"be":[147,158],"SETH.":[151],"Together,":[152],"they":[153],"imply":[154],"can":[157],"solved":[159],".":[162],"To":[163],"best":[165],"authors\u2019":[168],"knowledge,":[169],"these":[170],"improvements":[174],"over":[175],"exhaustive":[176],"search":[177],"literature.":[180]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}