On the value of a random minimum weight Steiner tree

DOI10.1007/S00493-004-0013-ZMaRDI QIDQ705741zbMATH OpenOpenAlexFDO

Authors Béla Bollobás, David Gamarnik, Oliver Riordan, Benny Sudakov

Publication date 14 February 2005

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-004-0013-z

zbMATH Keywords

random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05)

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)