This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
37th Annual Symposium on Foundations of Computer Science (FOCS '96)
A 3-approximation for the minimum tree spanning k vertices
Burlington, VT
October 14-October 16
ISBN: 0-8186-7594-2
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.
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, pp.302, 37th Annual Symposium on Foundations of Computer Science (FOCS '96), 1996
Usage of this product signifies your acceptance of the Terms of Use.