scientific article; zbMATH DE number 1444281

DOI10.1002/(SICI)1097-0037(200003)35:2%3C118::AID-NET3%3E3.0.CO;2-MzbMATH Open0968.90016MaRDI QIDQ4953322FDOQ4953322

Authors: Christos Alexopoulos, Jay A. Jacobson 

Publication date: 14 December 2000

Title of this publication is not available (Why is that?)

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

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

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)