logo
The Digital Librarian's Digital Library
DOCIS Documents in Computing and Information Science
 
Home >> Journals and Conference Proceedings >> ACM Symposium on Theory of Computing
 
 
Saving an epsilon: a 2-approximation for the k-MST problem in graphs
 
Naveen Garg
 
Journal Title: ACM Symposium on Theory of Computing
Date: 2005
 
 
 
For further information about this item go to:
http://doi.acm.org/10.1145/1060650
 
 
This data comes from DBLP
[SWISH++]Valid XHTML 1.0!
This page is maintained by Angela Cornwell and Thomas Krichel.
It was last updated on 2006-04-12