The minimum spanning tree problem with non-terminal set

The minimum spanning tree problem with non-terminal set (MSTNTS) NT consists of finding a minimum weight spanning tree where each non-terminal is not a leaf. We analyze the NP-Completeness and describe a factor @[email protected] approximation algorithm for the MSTNTS on symmetric and metric graphs, where @r is the approximation factor of a given algorithm for the travelling salesman problem (TSP), k(>=2) is the number of vertices that are not in NT.

[1]  Mohit Singh,et al.  A Randomized Rounding Approach to the Traveling Salesman Problem , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[2]  Stefan Hougardy,et al.  On approximation algorithms for the terminal Steiner tree problem , 2004, Inf. Process. Lett..

[3]  Bernhard Fuchs.  A note on the terminal Steiner tree problem , 2003, Inf. Process. Lett..

[4]  Nicos Christofides.  Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

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

[6]  Moshe Lewenstein,et al.  Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[7]  José Coelho de Pina,et al.  Algorithms for terminal Steiner trees , 2007, Theor. Comput. Sci..