On Shortest Paths in Graphs with Random Weights
From MaRDI portal
Publication:3699721
DOI10.1287/moor.10.4.557zbMath0578.05041OpenAlexW2051213257MaRDI QIDQ3699721
Publication date: 1985
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.kellogg.northwestern.edu/research/math/papers/593.pdf
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38)
Related Items (15)
Distribution of Minimal Path Lengths when Edge Lengths are Independent Heterogeneous Exponential Random Variables ⋮ Unnamed Item ⋮ All-pairs shortest paths and the essential subgraph ⋮ On the longest path of a randomly weighted tournament ⋮ Probabilistic analysis of optimization problems on generalized random shortest path metrics ⋮ Extreme value distributions for two kinds of path sums of Markov chain ⋮ Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs ⋮ Shortest paths in random weighted graphs ⋮ Probabilistic analysis of optimization problems on sparse random shortest path metrics ⋮ The value of side information in network flow optimization ⋮ Minimum-weight combinatorial structures under random cost-constraints ⋮ Random shortest paths: non-Euclidean instances for metric optimization problems ⋮ Finding real-valued single-source shortest paths in o(n 3) expected time ⋮ The expected length of a shortest path ⋮ A Forward-Backward Single-Source Shortest Paths Algorithm
This page was built for publication: On Shortest Paths in Graphs with Random Weights
