Back to Search
Start Over
ALMOST OPTIMAL SOLUTIONS TO k-CLUSTERING PROBLEMS.
- Source :
- International Journal of Computational Geometry & Applications; Aug2010, Vol. 20 Issue 4, p431-447, 17p, 2 Diagrams, 5 Charts, 4 Graphs
- Publication Year :
- 2010
-
Abstract
- We implement an algorithm for k-clustering for small k in fixed dimensions and report experimental results here. Although the theoretical bounds on the running time are hopeless for 1 + ∊ approximating k-clusters, we note that for dimensions 2 and 3, k-clustering is practical for small k (k ≤ 4) and simple enough shapes. For the purposes of this paper, k is a small fixed constant. [ABSTRACT FROM AUTHOR]
- Subjects :
- DIMENSIONS
ALGORITHMS
MATHEMATICS
GEOMETRY
UNITS of measurement
Subjects
Details
- Language :
- English
- ISSN :
- 02181959
- Volume :
- 20
- Issue :
- 4
- Database :
- Complementary Index
- Journal :
- International Journal of Computational Geometry & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 53471317
- Full Text :
- https://doi.org/10.1142/S0218195910003372