Sublinear time approximation scheme for clustering in metric spaces

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1999, Pages 154-159

  Indyk, Piotr ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FUNCTIONS; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING;

INTRACLUSTER DISTANCE; MINIMUM EDGE DELETION BIPARTITION PROBLEM; SUBLINEAR TIME APPROXIMATION;

COMPUTATIONAL COMPLEXITY;

EID: 0033317227     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)