Proceedings of 37th Conference on Foundations of Computer Science (1996)
Oct. 14, 1996 to Oct. 16, 1996
N. Garg , Max-Planck-Inst. fur Inf., Saarbrucken, Germany
In this paper we give a 3-approximation algorithm for the problem of finding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximation algorithm for the minimum tour that visits any k-vertices.
trees (mathematics); minimum tree; 3-approximation; k-vertices; minimum tour; graph; spanning k vertices
N. Garg, "A 3-approximation for the minimum tree spanning k vertices", Proceedings of 37th Conference on Foundations of Computer Science, vol. 00, no. , pp. 302, 1996, doi:10.1109/SFCS.1996.548489