loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
40th Annual Symposium on Foundations of Computer Science
A Sublinear Time Approximation Scheme for Clustering in Metric Spaces
New York, New York
October 17-October 18
ISBN: 0-7695-0409-4
ASCII Text
x 
 
Piotr Indyk, "A Sublinear Time Approximation Scheme for Clustering in Metric Spaces," Foundations of Computer Science, IEEE Annual Symposium on, pp. 154, 40th Annual Symposium on Foundations of Computer Science, 1999.
 
 
BibTex
x
 
@article{ 10.1109/SFFCS.1999.814587,
author = {Piotr Indyk},
title = {A Sublinear Time Approximation Scheme for Clustering in Metric Spaces},
journal ={Foundations of Computer Science, IEEE Annual Symposium on},
volume = {0},
year = {1999},
issn = {0272-5428},
pages = {154},
doi = {http://doi.ieeecomputersociety.org/10.1109/SFFCS.1999.814587},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Foundations of Computer Science, IEEE Annual Symposium on
TI - A Sublinear Time Approximation Scheme for Clustering in Metric Spaces
SN - 0272-5428
SP
EP
A1 - Piotr Indyk,
PY - 1999
VL - 0
JA - Foundations of Computer Science, IEEE Annual Symposium on
ER -
 
Piotr Indyk, Stanford University
The metric 2-clustering problem is defined as follows: given a metric (X; d), partition X into two sets S1 and S2 in order to minimize the value of \math\math d(u,v) i {u,v}\math Si In this paper we show an approximation scheme for this problem.
Citation:
Piotr Indyk, "A Sublinear Time Approximation Scheme for Clustering in Metric Spaces," focs, pp.154, 40th Annual Symposium on Foundations of Computer Science, 1999
Usage of this product signifies your acceptance of the Terms of Use.