Optimal algorithms for approximate clustering

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1988, Pages 434-444

  Feder, Tomás ^a   Greene, Daniel H ^b  

^a STANFORD UNIVERSITY   (United States)

^b PALO ALTO RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

CLUSTER SIZES; CLUSTERING PROBLEMS; D-DIMENSIONAL SPACES; MAXIMUM DISTANCE; OPTIMAL ALGORITHM;

CLUSTERING ALGORITHMS;

EID: 84898929089     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/62212.62255     Document Type: Conference Paper

References (0)