On the value of a random minimum weight Steiner tree
From MaRDI portal
Publication:705741
Recommendations
- Maximal Steiner trees in the stochastic mean-field model of distance
- On the value of a random minimum spanning tree problem
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
- On finding a minimum spanning tree in a network with random weights
- On random minimum length spanning trees
Cited in
(7)- Analysis of Steiner subtrees of random trees for traceroute algorithms
- The distribution of minimum-weight cliques and other subgraphs in graphs with random edge weights
- Weak disorder asymptotics in the stochastic mean-field model of distance
- scientific article; zbMATH DE number 3985248 (Why is no real title available?)
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
- Asymptotic theory of greedy approximations to minimal k-point random graphs
- Maximal Steiner trees in the stochastic mean-field model of distance
This page was built for publication: On the value of a random minimum weight Steiner tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q705741)