On the value of a random minimum weight Steiner tree
From MaRDI portal
Publication:705741
Let the edge weights of the complete graph on \(n\) vertices be chosen randomly and independently from an exponential distribution with parameter 1. Fix \(k=o(n)\) vertices. The weight of the minimum weight Steiner tree containing these vertices is approaching \((k-1)(\log n-\log k)/n\) with probability converging to 1.
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
(9)- Weak disorder asymptotics in the stochastic mean-field model of distance
- Analysis of Steiner subtrees of random trees for traceroute algorithms
- The weight of the shortest path tree
- scientific article; zbMATH DE number 3985248 (Why is no real title available?)
- On the Critical Value for ‘Percolation’ of Minimum-Weight Trees in the Mean-Field Distance Model
- Asymptotic theory of greedy approximations to minimal k-point random graphs
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
- The distribution of minimum-weight cliques and other subgraphs in graphs with random edge weights
- 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)
