A constant-factor approximation algorithm for the k MST problem (extended abstract)

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Avrim Blum School of Computer Science, Carnegie Mellon University, Pittsburgh, PA
R. Ravi Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh PA
Santosh Vempala School of Computer Science, Carnegie Mellon University, Pittsburgh, PA
Published in:
Cover Image
 
· Proceeding
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Pages 442-448
ACM New York, NY, USA ©1996
table of contents ISBN:0-89791-785-5 doi>10.1145/237814.237992
A constant-factor approximation algorithm for the <italic>k</italic> MST problem (extended abstract) Published by ACM 1996 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 18
· Downloads (cumulative): 377
· Citation Count: 14


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder