Pages that link to "Item:Q1408818"

The following pages link to The complexity of minimizing certain cost metrics for \(k\)-source spanning trees. (Q1408818):

Displaying 8 items.

• Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs (Q845678) (← links)
• On the intercluster distance of a tree metric (Q861256) (← links)
• Multi-source spanning trees: Algorithms for minimizing source eccentricities. (Q1427201) (← links)
• The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices (Q1806599) (← links)
• An improved algorithm for the \(k\)-source maximum eccentricity spanning trees (Q1887071) (← links)
• Minimax flow tree problems (Q3057112) (← links)
• A polynomial time approximation scheme for the two-source minimum routing cost spanning trees (Q4805401) (← links)
• Computational Science and Its Applications – ICCSA 2004 (Q5901295) (← links)