Pages that link to "Item:Q4500852"
From MaRDI portal
The following pages link to A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees (Q4500852):
Displaying 9 items.
- Lagrangean bounds for the optimum communication spanning tree problem (Q611003) (← links)
- On the intercluster distance of a tree metric (Q861256) (← 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)
- Solving the optimum communication spanning tree problem (Q1991267) (← links)
- A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem (Q2357170) (← links)
- A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem (Q2632008) (← links)
- Light graphs with small routing cost (Q4537619) (← links)
- New Valid Inequalities for the Optimal Communication Spanning Tree Problem (Q5138258) (← links)