scientific article; zbMATH DE number 2080486
From MaRDI portal
Publication:4473284
zbMath1047.68594MaRDI QIDQ4473284
V. S. Lakshmanan, Anthony K. H. Tung, Raymond T. Ng, Jiawei Han
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1973/19730405.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
On the complexity of clustering with relaxed size constraints in fixed dimension ⋮ Using projection-based clustering to find distance- and density-based clusters in high-dimensional data ⋮ On the Complexity of Clustering with Relaxed Size Constraints
This page was built for publication:
