Pages that link to "Item:Q2942691"
From MaRDI portal
The following pages link to New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem (Q2942691):
Displaying 4 items.
- Greedy heuristics for the diameter-constrained minimum spanning tree problem (Q844529) (← links)
- Finding bounded diameter minimum spanning tree in general graphs (Q2147109) (← links)
- A hybrid heuristic for the diameter constrained minimum spanning tree problem (Q2268933) (← links)
- Constructing minimal spanning/Steiner trees with bounded path length (Q4397100) (← links)