A constant factor approximation algorithm for generalized min-sum set cover

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Nikhil Bansal IBM T. J. Watson Research Center, Yorktown Heights, NY
Anupam Gupta Carnegie Mellon University, Pittsburgh, PA
Ravishankar Krishnaswamy IBM T. J. Watson Research Center
Published in:
· Proceeding
SODA '10 Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms
Pages 1539-1545
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2010
table of contents ISBN: 978-0-898716-98-6
A constant factor approximation algorithm for generalized min-sum set cover 2010 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 31
· Downloads (cumulative): 79
· Citation Count: 3


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