{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T10:51:22Z","timestamp":1771843882361,"version":"3.50.1"},"reference-count":9,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2007,3,9]],"date-time":"2007-03-09T00:00:00Z","timestamp":1173398400000},"content-version":"vor","delay-in-days":8590,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1983,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper considers a stochastic version of bottleneck spanning tree problem in which edge costs are random variables. The problem is to find an optimal spanning tree under the chance constraint with respect to bottleneck (maximum cost) edge of spanning tree. The problem is first transformed into a deterministic equivalent problem. Then its subproblem is introduced and a close relation between these problems is clarified. Finally, based on the relation, an algorithm which finds an optimal spanning tree of the original problem in a polynomial order of its problem size is proposed.<\/jats:p>","DOI":"10.1002\/net.3230130311","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T16:49:46Z","timestamp":1178902186000},"page":"443-449","source":"Crossref","is-referenced-by-count":22,"title":["Stochastic bottleneck spanning tree problem"],"prefix":"10.1002","volume":"13","author":[{"given":"Hiroaki","family":"Ishii","sequence":"first","affiliation":[]},{"given":"Toshio","family":"Nishida","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,3,9]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Programming, Games and Transportation Networks","author":"Berge C.","year":"1965"},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","unstructured":"R.Chandrasekaran Minimal ratio spanning trees. Networks. (1977)335\u2013342.","DOI":"10.1002\/net.3230070405"},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","unstructured":"D.CheritonandR. E.Tarjan Finding minimum spanning trees.SIAM J. Comput. (1976)724\u2013742.","DOI":"10.1137\/0205051"},{"key":"e_1_2_1_5_2","volume-title":"Graph Theory: An Algorithmic Approach","author":"Christofides N.","year":"1975"},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","unstructured":"H. N.Gabow A good algorithm for smallest spanning trees with a degree constraint.Networks. (1978)201\u2013208.","DOI":"10.1002\/net.3230080304"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.4.414"},{"key":"e_1_2_1_9_2","doi-asserted-by":"crossref","unstructured":"R. C.Prim Shortest connection networks and some generalization.Bell System Tech. J. (1957)1389.","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(75)90056-3"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230130311","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230130311","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T22:54:10Z","timestamp":1697756050000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230130311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,9]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,9]]}},"alternative-id":["10.1002\/net.3230130311"],"URL":"https:\/\/doi.org\/10.1002\/net.3230130311","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,9]]}}}