The following pages link to (Q4017161):
Displaying 5 items.
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks (Q452816) (← links)
- Greedy heuristics for the diameter-constrained minimum spanning tree problem (Q844529) (← links)
- An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees (Q863567) (← links)
- Counting weighted spanning trees to solve constrained minimum spanning tree problems (Q2011588) (← links)
- A hybrid heuristic for the diameter constrained minimum spanning tree problem (Q2268933) (← links)
