scientific article; zbMATH DE number 1444281

DOI10.1002/(SICI)1097-0037(200003)35:2%3C118::AID-NET3%3E3.0.CO;2-MMaRDI QIDQ4953322zbMATH OpenFDO

Authors Christos Alexopoulos, Jay A. Jacobson

Publication date 14 December 2000

zbMATH Keywords

minimum spanning treereliabilityMonte Carlo methodsstochastic networksprobability measuresspanning rees

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial optimization (90C27) Stochastic network models in operations research (90B15)

Recommendations

• Bounding Distributions for the Weight of a Minimum Spanning Tree in Stochastic Networks
• Stochastic minimum spanning trees and related problems
• The probabilistic minimum spanning tree problem
• Stochastic minimum spanning trees in Euclidean spaces
• An optimal minimum spanning tree algorithm

Cited in

(6)

• Bounding Distributions for the Weight of a Minimum Spanning Tree in Stochastic Networks
• Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points
• Minimum spanning trees in networks with varying edge weights
• Stochastic minimum spanning trees and related problems
• Optimal Grouping of State Spaces of Discrete Stochastic Systems
• State‐space partition techniques for multiterminal flows in stochastic networks

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953322)