The minimum spanning tree problem with non-terminal set

Authors:
Tongquan Zhang;Ying Yin
Affiliations:
School of Mathematics and Computer Science, Yunnan Nationalities University, Kunming, 650031, PR China;Department of Mathematics, Faculty of Science, Kunming University of Science and Technology, Kunming, 650093, PR China
Venue:
Information Processing Letters
Year:
2012

Citing 5
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A note on the terminal Steiner tree problem

Information Processing Letters
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Algorithms for terminal Steiner trees

Theoretical Computer Science
A Randomized Rounding Approach to the Traveling Salesman Problem

FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

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 @r+@rk 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.