Pages that link to "Item:Q4537623"
From MaRDI portal
The following pages link to Exact algorithms for minimum routing cost trees (Q4537623):
Displayed 10 items.
- Lagrangean bounds for the optimum communication spanning tree problem (Q611003) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Designing a road network for hazardous materials shipments (Q853892) (← links)
- On the intercluster distance of a tree metric (Q861256) (← links)
- On the minimum average distance spanning tree of the hypercube (Q934836) (← links)
- Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← links)
- Compact vs. exponential-size LP relaxations (Q1612003) (← links)
- Approximation algorithms for the optimal \(p\)-source communication spanning tree (Q1887037) (← links)
- Integer Linear Programming in Computational Biology (Q3644723) (← links)
- Optimization in telecommunication networks (Q5313481) (← links)