Optimal algorithms for approximate clustering

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Tomás Feder Computer Science Department, Stanford University, Stanford, CA
Daniel Greene Xerox Palo Alto Research Center, Palo Alto, CA
Published in:
· Proceeding
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Pages 434-444
ACM New York, NY, USA ©1988
table of contents ISBN:0-89791-264-0 doi>10.1145/62212.62255
Optimal algorithms for approximate clustering Published by ACM 1988 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 16
· Downloads (12 Months): 143
· Downloads (cumulative): 1,597
· Citation Count: 94


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