Pages that link to "Item:Q1887037"
From MaRDI portal
The following pages link to Approximation algorithms for the optimal \(p\)-source communication spanning tree (Q1887037):
Displaying 6 items.
- Models and algorithms for network reduction (Q320811) (← links)
- Tight bounds from a path based formulation for the tree of hub location problem (Q833527) (← links)
- On the intercluster distance of a tree metric (Q861256) (← links)
- An improved algorithm for the \(k\)-source maximum eccentricity spanning trees (Q1887071) (← links)
- General network design: a unified view of combined location and network design problems (Q1926688) (← links)
- The swap edges of a multiple-sources routing tree (Q2479532) (← links)
