Subquadratic approximation algorithms for clustering problems in high dimensional spaces

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1999, Pages 435-444

  Borodin, Allan ^a   Ostrovsky, Rafail ^a   Rabani, Yuval ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PARAMETER ESTIMATION; PROBLEM SOLVING; RANDOM PROCESSES;

CLUSTERING RULES; SUBQUADRATIC APPROXIMATION ALGORITHMS;

COMPUTATIONAL COMPLEXITY;

EID: 0032632361     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/301250.301367     Document Type: Article

References (19)