On Frieze's \(\zeta\) (3) limit for lengths of minimal spanning trees

DOI10.1016/0166-218X(87)90047-3zbMath0621.05012MaRDI QIDQ1090335

J. Michael Steele

Publication date: 1987

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

minimal spanning tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Renewal theory (60K05)

Related Items (11)

Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points ⋮ A survey on combinatorial optimization in dynamic environments ⋮ A concentration inequality for the facility location problem ⋮ Successive minimum spanning trees ⋮ Models of random subtrees of a graph ⋮ On the Length of a Random Minimum Spanning Tree ⋮ Minimum Cost Matching in a Random Graph with Random Costs ⋮ A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks ⋮ On random minimum length spanning trees ⋮ On the Difference of Expected Lengths of Minimum Spanning Trees ⋮ On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph

Cites Work

• Unnamed Item
• Unnamed Item
• On the connectivity of random m-orientable graphs and digraphs
• On the value of a random minimum spanning tree problem
• The expected linearity of a simple equivalence algorithm
• On the Expected Value of a Random Assignment Problem
• Optimization Problems on Graphs with Independent Random Edge Weights

This page was built for publication: On Frieze's \(\zeta\) (3) limit for lengths of minimal spanning trees