A constant factor approximation algorithm for a class of classification problems

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Anupam Gupta Computer Science Division, UC Berkeley, Berkeley, CA
Éva Tardos Department of Computer Science, Cornell University, Ithaca, NY
Published in:
Cover Image
 
· Proceeding
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Pages 652-658
ACM New York, NY, USA ©2000
table of contents ISBN:1-58113-184-4 doi>10.1145/335305.335397
A constant factor approximation algorithm for a class of classification problems Published by ACM 2000 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 15
· Downloads (cumulative): 340
· Citation Count: 19


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