Pages that link to "Item:Q452816"
From MaRDI portal
The following pages link to A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks (Q452816):
Displaying 4 items.
- On asymptotically optimal approach for the problem of finding several edge-disjoint spanning trees of given diameter in an undirected graph with random edge weights (Q2117617) (← links)
- The cavity approach for Steiner trees packing problems (Q3303270) (← links)
- Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics (Q5089179) (← links)
- On asymptotically optimal approach for finding of the minimum total weight of edge-disjoint spanning trees with a given diameter (Q6082044) (← links)
