{"id":"https://openalex.org/W1974763826","doi":"https://doi.org/10.1002/net.3230130311","title":"Stochastic bottleneck spanning tree problem","display_name":"Stochastic bottleneck spanning tree problem","publication_year":1983,"publication_date":"1983-09-01","ids":{"openalex":"https://openalex.org/W1974763826","doi":"https://doi.org/10.1002/net.3230130311","mag":"1974763826"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230130311","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230130311","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/A5042857584","display_name":"Hiroaki Ishii","orcid":"https://orcid.org/0000-0002-1057-5743"},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Hiroaki Ishii","raw_affiliation_strings":["Department of Applied Physics, Faculty of Engineering, Osaka University, Osaka, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Applied Physics, Faculty of Engineering, Osaka University, Osaka, Japan","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015536081","display_name":"Toshio Nishida","orcid":null},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Toshio Nishida","raw_affiliation_strings":["Department of Applied Physics, Faculty of Engineering, Osaka University, Osaka, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Applied Physics, Faculty of Engineering, Osaka University, Osaka, Japan","institution_ids":["https://openalex.org/I98285908"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042857584"],"corresponding_institution_ids":["https://openalex.org/I98285908"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.22509351,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"13","issue":"3","first_page":"443","last_page":"449"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9864000082015991,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9864000082015991,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9837999939918518,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9735999703407288,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/spanning-tree","display_name":"Spanning tree","score":0.8721377849578857},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.6722533106803894},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6557326316833496},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5936228632926941},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5817958116531372},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5618751049041748},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5561425089836121},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.5392258763313293},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5052643418312073},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4421883523464203},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.40811917185783386},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3015865981578827},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3004186153411865},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2405368983745575},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.17709243297576904}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8721377849578857},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.6722533106803894},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6557326316833496},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5936228632926941},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5817958116531372},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5618751049041748},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5561425089836121},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.5392258763313293},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5052643418312073},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4421883523464203},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.40811917185783386},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3015865981578827},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3004186153411865},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2405368983745575},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.17709243297576904},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230130311","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230130311","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":9,"referenced_works":["https://openalex.org/W1965680834","https://openalex.org/W1973942323","https://openalex.org/W1985783557","https://openalex.org/W2017927472","https://openalex.org/W2027029507","https://openalex.org/W2033250446","https://openalex.org/W2128865241","https://openalex.org/W2800875754","https://openalex.org/W4302399279"],"related_works":["https://openalex.org/W3016811403","https://openalex.org/W2943635264","https://openalex.org/W1561849181","https://openalex.org/W2390742649","https://openalex.org/W193918669","https://openalex.org/W620960161","https://openalex.org/W2045244794","https://openalex.org/W2350349857","https://openalex.org/W2582147058","https://openalex.org/W1576317141"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"considers":[3],"a":[4,48,58,84],"stochastic":[5],"version":[6],"of":[7,39,79,87],"bottleneck":[8,35],"spanning":[9,26,40,77],"tree":[10,27,78],"problem":[11,20,43,82,89],"in":[12,83],"which":[13,73],"edge":[14,38],"costs":[15],"are":[16],"random":[17],"variables.":[18],"The":[19,42],"is":[21,44,55,64,91],"to":[22,34],"find":[23],"an":[24,71,75],"optimal":[25,76],"under":[28],"the":[29,69,80],"chance":[30],"constraint":[31],"with":[32],"respect":[33],"(maximum":[36],"cost)":[37],"tree.":[41],"first":[45],"transformed":[46],"into":[47],"deterministic":[49],"equivalent":[50],"problem.":[51],"Then":[52],"its":[53,88],"subproblem":[54],"introduced":[56],"and":[57],"close":[59],"relation":[60],"between":[61],"these":[62],"problems":[63],"clarified.":[65],"Finally,":[66],"based":[67],"on":[68],"relation,":[70],"algorithm":[72],"finds":[74],"original":[81],"polynomial":[85],"order":[86],"size":[90],"proposed.":[92]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-06T13:50:29.536080","created_date":"2025-10-10T00:00:00"}