SIGN IN
SIGN UP
Approximate clustering via core-sets
Full Text:
Pdf
Buy this Article
Authors:
Mihai Bādoiu
MIT Laboratory for Comp. Sci., Cambridge, MA
Sariel Har-Peled
University of Illinois, Urbana, IL
Piotr Indyk
MIT Laboratory for Comp. Sci., Cambridge, MA
Published in:
· Proceeding
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Pages 250 - 257
ACM
New York, NY
, USA
©2002
table of contents
ISBN:1-58113-495-9
doi>
10.1145/509907.509947
2002 Article
Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 53
· Downloads (cumulative): 801
· Citation Count: 87
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC '14
Share:
|
Tags:
algorithms
algorithms
experimentation
linear approximation
performance
set theory
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder