Polynomial time approximation schemes for geometric k-clustering

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2000, Pages 349-358

  Ostrovsky, Rafail ^a   Rabani, Yuval ^a  

^a TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA REDUCTION; DATA STRUCTURES; POLYNOMIALS; THEOREM PROVING;

DATA CLUSTERING; POLYNOMIAL TIME APPROXIMATION SCHEMES;

COMPUTATIONAL GEOMETRY;

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

References (37)