Approximation algorithms for some optimum communication spanning tree problems
From MaRDI portal
Publication:1566575
DOI10.1016/S0166-218X(99)00212-7zbMath0957.68088OpenAlexW2030879379MaRDI QIDQ1566575
Kun-Mao Chao, Chuan Yi Tang, Bang Ye Wu
Publication date: 27 November 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00212-7
Related Items (21)
Approximation algorithms for the optimal \(p\)-source communication spanning tree ⋮ An improved algorithm for the \(k\)-source maximum eccentricity spanning trees ⋮ Light graphs with small routing cost ⋮ A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem ⋮ Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs ⋮ Models and algorithms for network reduction ⋮ Designing a road network for hazardous materials shipments ⋮ Combined column-and-row-generation for the optimal communication spanning tree problem ⋮ On the intercluster distance of a tree metric ⋮ Lagrangean bounds for the optimum communication spanning tree problem ⋮ The complexity of minimizing certain cost metrics for \(k\)-source spanning trees. ⋮ Unnamed Item ⋮ Multi-source spanning trees: Algorithms for minimizing source eccentricities. ⋮ New Valid Inequalities for the Optimal Communication Spanning Tree Problem ⋮ Finding best swap edges minimizing the routing cost of a spanning tree ⋮ Solving the optimum communication spanning tree problem ⋮ The swap edges of a multiple-sources routing tree ⋮ Minimax flow tree problems ⋮ The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm ⋮ Network design for time‐constrained delivery ⋮ A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem
Cites Work
This page was built for publication: Approximation algorithms for some optimum communication spanning tree problems
