Pages that link to "Item:Q1408818"
From MaRDI portal
The following pages link to The complexity of minimizing certain cost metrics for \(k\)-source spanning trees. (Q1408818):
Displaying 4 items.
- On the intercluster distance of a tree metric (Q861256) (← links)
- Multi-source spanning trees: Algorithms for minimizing source eccentricities. (Q1427201) (← links)
- An improved algorithm for the \(k\)-source maximum eccentricity spanning trees (Q1887071) (← links)
- Minimax flow tree problems (Q3057112) (← links)