Journal of the Operations Research Society of Japan
Online ISSN : 2188-8299
Print ISSN : 0453-4514
ISSN-L : 0453-4514
MINIMUM SPANNING TREE WITH NORMAL VARIATES AS WEIGHTS
Tetsuo Ichimori, Shogo Shiode, Hiroaki Ishii, Toshio Nishida
Author information
JOURNAL FREE ACCESS

1981 Volume 24 Issue 1 Pages 61-66

Details
Download PDF (304K)
Download citation RIS

(compatible with EndNote, Reference Manager, ProCite, RefWorks)

BIB TEX

(compatible with BibDesk, LaTeX)

Text
How to download citation
Contact us
Abstract
When weights of arcs in a graph are normal variates, we seek a spanning tree maximizing the probability that the sum of weights of arcs in the spanning tree is not greater than a given constant. An O(e^2n) algorithm for it is given.
Content from these authors
© 1981 The Operations Research Society of Japan
Previous article Next article
Favorites & Alerts

Recently viewed articles
Share this page
feedback
 Top