A polynomial time approximation scheme for minimum routing cost spanning trees
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Hi-index | 0.00 |
Let G = (V, E,w) be an undirected graph with nonnegative edge weight w, and r be a nonnegative vertex weight. The product-requirement optimum communication spanning tree (PROCT) problem is to find a spanning tree T minimizing Σi,j∈V r(i)r(j)d(T, i, j), where d(T, i, j) is the distance between i and j on T. The sum-requirement optimum communication spanning tree (SROCT) problem is to minimize Σi,j∈V (r(i) + r(j))d(T, i, j). Both the two problems are special cases of the general optimum communication spanning tree problem, and are generalizations of the shortest total path length spanning tree problem. In this paper, we present an O(n5) time 1.577-approximation algorithm for the PROCT problem, and an O(n3) time 2-approximation algorithm for the SROCT problem, where n is the number of vertices.