Optimum Communication Spanning Trees

Kun-Mao Chao National Taiwan University 59.

[1]  Matteo Fischetti,et al.  Exact algorithms for minimum routing cost trees , 2002, Networks.

[2]  Chuan Yi Tang,et al.  A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees , 2000, J. Algorithms.

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Chuan Yi Tang,et al.  A polynomial time approximation scheme for minimum routing cost spanning trees , 1998, SODA '98.

[5]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[6]  Chuan Yi Tang,et al.  Approximation algorithms for the shortest total path length spanning tree problem , 2000, Discret. Appl. Math..

[7]  Chuan Yi Tang,et al.  Approximation algorithms for some optimum communication spanning tree problems , 1998, Discret. Appl. Math..

[8]  T. C. Hu.  Optimum Communication Spanning Trees , 1974, SIAM J. Comput..

[9]  Richard T. Wong,et al.  Worst-Case Analysis of Network Design Problem Heuristics , 1980, SIAM J. Algebraic Discret. Methods.

[10]  Bang Ye Wu.  Approximation algorithms for the optimal p-source communication spanning tree , 2004, Discret. Appl. Math..

[11]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[12]  Kun-Mao Chao,et al.  Spanning trees and optimization problems , 2004, Discrete mathematics and its applications.

[13]  Jan Karel Lenstra,et al.  The complexity of the network design problem , 1978, Networks.

[14]  Bang Ye Wu,et al.  A polynomial time approximation scheme for the two-source minimum routing cost spanning trees , 2002, J. Algorithms.