Pages that link to "Item:Q1566575"

The following pages link to Approximation algorithms for some optimum communication spanning tree problems (Q1566575):

Displaying 21 items.

• Models and algorithms for network reduction (Q320811) (← links)
• Finding best swap edges minimizing the routing cost of a spanning tree (Q476426) (← links)
• Lagrangean bounds for the optimum communication spanning tree problem (Q611003) (← links)
• Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs (Q845678) (← links)
• Designing a road network for hazardous materials shipments (Q853892) (← links)
• On the intercluster distance of a tree metric (Q861256) (← links)
• The complexity of minimizing certain cost metrics for \(k\)-source spanning trees. (Q1408818) (← links)
• Multi-source spanning trees: Algorithms for minimizing source eccentricities. (Q1427201) (← links)
• Combined column-and-row-generation for the optimal communication spanning tree problem (Q1652585) (← 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)
• The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm (Q2317621) (← links)
• A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem (Q2357170) (← links)
• The swap edges of a multiple-sources routing tree (Q2479532) (← links)
• A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem (Q2632008) (← links)
• Minimax flow tree problems (Q3057112) (← links)
• Light graphs with small routing cost (Q4537619) (← links)
• New Valid Inequalities for the Optimal Communication Spanning Tree Problem (Q5138258) (← links)
• Network design for time‐constrained delivery (Q5503760) (← links)
• (Q6124759) (← links)