scientific article; zbMATH DE number 795219

zbMATH Open0839.90136MaRDI QIDQ4845368FDOQ4845368

Authors: Timothy Law Snyder, J. Michael Steele 

Publication date: 23 June 1996

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

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

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)

Cited In (8)

• Finding the shortest path in stochastic networks
• Title not available (Why is that?)
• Probabilistic NetKAT
• Optimal paths in probabilistic networks
• Algorithm for computing transition probability between components in Internetware
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)