scientific article; zbMATH DE number 795219

MaRDI QIDQ4845368zbMATH OpenFDO

Authors Timothy Law Snyder, J. Michael Steele

Publication date 23 June 1996

zbMATH Keywords

minimum spanning treerandomized algorithmsmatchingsSteiner minimum treespercolation theoryEuclidean traveling salesmantaveling salesman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Stochastic network models in operations research (90B15)

Recommendations

• scientific article; zbMATH DE number 3936510
• Probabilistic Analysis of Network Flow Algorithms
• Probabilistic analysis of a network design problem heuristic
• Probability and Computing
• Optimal paths in probabilistic networks

Cited in

(8)

• Finding the shortest path in stochastic networks
• scientific article; zbMATH DE number 6452615 (Why is no real title available?)
• Probabilistic NetKAT
• Optimal paths in probabilistic networks
• Algorithm for computing transition probability between components in Internetware
• scientific article; zbMATH DE number 6492481 (Why is no real title available?)
• scientific article; zbMATH DE number 3821434 (Why is no real title available?)
• scientific article; zbMATH DE number 3918277 (Why is no real title available?)

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 Q4845368)