Pages that link to "Item:Q1582085"
From MaRDI portal
The following pages link to Approximation algorithms for the shortest total path length spanning tree problem (Q1582085):
Displaying 12 items.
- Models and algorithms for network reduction (Q320811) (← links)
- Spanning trees: A survey (Q659663) (← links)
- On the intercluster distance of a tree metric (Q861256) (← links)
- On the minimum average distance spanning tree of the hypercube (Q934836) (← links)
- Approximation algorithms for the optimal \(p\)-source communication spanning tree (Q1887037) (← links)
- An improved algorithm for the \(k\)-source maximum eccentricity spanning trees (Q1887071) (← links)
- Bounded-degree light approximate shortest-path trees in doubling metrics (Q2235274) (← links)
- On the minimum routing cost clustered tree problem (Q2359809) (← links)
- The zoo of tree spanner problems (Q2476246) (← links)
- DISTANCE PRESERVING SUBTREES IN MINIMUM AVERAGE DISTANCE SPANNING TREES (Q2864852) (← links)
- AN OPTIMAL REBUILDING STRATEGY FOR AN INCREMENTAL TREE PROBLEM (Q3636563) (← links)
- Light graphs with small routing cost (Q4537619) (← links)
