{"id":"https://openalex.org/W2080156195","doi":"https://doi.org/10.1002/net.3230170107","title":"Problem reduction methods and a tree generation algorithm for the steiner network problem","display_name":"Problem reduction methods and a tree generation algorithm for the steiner network problem","publication_year":1987,"publication_date":"1987-01-01","ids":{"openalex":"https://openalex.org/W2080156195","doi":"https://doi.org/10.1002/net.3230170107","mag":"2080156195"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230170107","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230170107","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/A5103024611","display_name":"Anantaram Balakrishnan","orcid":"https://orcid.org/0000-0002-8417-2429"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Anantaram Balakrishnan","raw_affiliation_strings":["Krannert Graduate School of Management, Purdue University W. Lafayette, Indiana 47907","Purdue Univ., W. Lafayette, IN"],"affiliations":[{"raw_affiliation_string":"Krannert Graduate School of Management, Purdue University W. Lafayette, Indiana 47907","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Purdue Univ., W. Lafayette, IN","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103551957","display_name":"Nitin R. Patel","orcid":null},"institutions":[{"id":"https://openalex.org/I150870154","display_name":"Indian Institute of Management Ahmedabad","ror":"https://ror.org/02egcpy68","country_code":"IN","type":"education","lineage":["https://openalex.org/I150870154"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Nitin R. Patel","raw_affiliation_strings":["Indian Institute of Management, Ahmedabad, India 380015","Indian Institute of Management  Ahmedabad India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Management, Ahmedabad, India 380015","institution_ids":["https://openalex.org/I150870154"]},{"raw_affiliation_string":"Indian Institute of Management  Ahmedabad India","institution_ids":["https://openalex.org/I150870154"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103024611"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":2.6163,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.89186555,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"17","issue":"1","first_page":"65","last_page":"85"},"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.9836000204086304,"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.9836000204086304,"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/T11606","display_name":"Infrastructure Maintenance and Monitoring","score":0.9671000242233276,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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/T10264","display_name":"Asphalt Pavement Performance Evaluation","score":0.9573000073432922,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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.922667920589447},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.7264796495437622},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5372656583786011},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5246151685714722},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5133325457572937},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5108832716941833},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47737547755241394},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47242677211761475},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45992857217788696},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45958390831947327},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.45054706931114197},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.4126896560192108},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21880385279655457},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07117119431495667}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.922667920589447},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.7264796495437622},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5372656583786011},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5246151685714722},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5133325457572937},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5108832716941833},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47737547755241394},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47242677211761475},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45992857217788696},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45958390831947327},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.45054706931114197},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.4126896560192108},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21880385279655457},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07117119431495667},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230170107","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230170107","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":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.49000000953674316}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1965680834","https://openalex.org/W1990488643","https://openalex.org/W1996668544","https://openalex.org/W2007503572","https://openalex.org/W2008771115","https://openalex.org/W2011039300","https://openalex.org/W2020586530","https://openalex.org/W2025061866","https://openalex.org/W2054695963","https://openalex.org/W2064086982","https://openalex.org/W2075910004","https://openalex.org/W2086709935","https://openalex.org/W2091507391","https://openalex.org/W2101240310","https://openalex.org/W2132087752","https://openalex.org/W2167539320","https://openalex.org/W3127447045","https://openalex.org/W4250828313"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W2044443696","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181","https://openalex.org/W3081212354"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"Steiner":[2,33,61,127],"network":[3,62,128],"problem":[4,67,129],"seeks":[5],"a":[6,13,19,38,66,76,116],"minimum":[7],"weight":[8],"connected":[9],"subgraph":[10],"that":[11,95,120],"spans":[12],"specified":[14],"subset":[15],"off":[16],"nodes":[17,29],"in":[18,44],"given":[20],"graph":[21],"and":[22,47,64,93],"optionally":[23],"uses":[24],"any":[25],"of":[26,40,59,79,90,125],"the":[27,80,122,126],"other":[28],"as":[30],"intermediate":[31],"or":[32],"points.":[34],"This":[35],"model":[36],"has":[37],"variety":[39],"practical":[41],"applications":[42],"particularly":[43],"location,":[45],"transportation,":[46],"communication":[48],"planning.":[49],"In":[50],"this":[51,85,96],"paper,":[52],"we":[53],"first":[54],"outline":[55],"some":[56],"distinctive":[57],"characteristics":[58],"optimal":[60,100],"solutions":[63],"propose":[65],"reduction":[68,82],"procedure":[69],"based":[70],"on":[71],"these":[72],"properties.":[73],"We":[74,102,113],"derive":[75],"conservative":[77],"estimate":[78],"expected":[81],"achieved":[83],"by":[84],"method":[86],"under":[87],"one":[88],"set":[89],"probabilistic":[91],"assumptions":[92],"demonstrate":[94],"scheme":[97],"produces":[98],"asymptotically":[99],"reduction.":[101],"also":[103],"report":[104],"computational":[105],"results":[106],"for":[107],"several":[108],"randomly":[109],"generated":[110],"test":[111],"problems.":[112],"then":[114],"devise":[115],"tree":[117,136],"generation":[118],"algorithm":[119],"exploits":[121],"special":[123],"structure":[124],"while":[130],"solving":[131],"its":[132],"constrained":[133],"minimal":[134],"spanning":[135],"formulation.":[137]},"counts_by_year":[{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}