Maximal Steiner Trees in the Stochastic Mean-Field Model of Distance

DOI10.1017/S0963548317000220zbMath1379.60009arXiv1507.04282OpenAlexW2964052667MaRDI QIDQ5373830

No author found.

Publication date: 27 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.04282

zbMATH Keywords

Steiner treesmean-field model

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Combinatorial probability (60C05)

Cites Work

• The mean field traveling salesman and related problems
• On the value of a random minimum weight Steiner tree
• On the value of a random minimum spanning tree problem
• First Passage Percolation on the Erdős–Rényi Random Graph
• Size and Weight of Shortest Path Trees with Exponential Link Weights
• One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
• Diameter of the Stochastic Mean-Field Model of Distance
• On Random Symmetric Travelling Salesman Problems

This page was built for publication: Maximal Steiner Trees in the Stochastic Mean-Field Model of Distance