The Community for Technology Leaders
RSS Icon
Subscribe
Burlington, VT
Oct. 14, 1996 to Oct. 16, 1996
ISBN: 0-8186-7594-2
pp: 302
N. Garg , Max-Planck-Inst. fur Inf., Saarbrucken, Germany
ABSTRACT
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.
INDEX TERMS
trees (mathematics); minimum tree; 3-approximation; k-vertices; minimum tour; graph; spanning k vertices
CITATION
N. Garg, "A 3-approximation for the minimum tree spanning k vertices", FOCS, 1996, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 1996, pp. 302, doi:10.1109/SFCS.1996.548489
30 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool