scientific article
From MaRDI portal
Publication:2883188
zbMath1238.68142MaRDI QIDQ2883188
Massimiliano Goldwurm, Jianyi Lin, Francesco Saccà, Alberto Bertoni
Publication date: 11 May 2012
Full work available at URL: http://iospress.metapress.com/content/ph720t2kq50h6q77/fulltext.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10)
Related Items (6)
Exact algorithms for size constrained 2-clustering in the plane ⋮ NP-hardness of \(m\)-dimensional weighted matching problems ⋮ Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering ⋮ On the complexity of clustering with relaxed size constraints in fixed dimension ⋮ Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization ⋮ On the Complexity of Clustering with Relaxed Size Constraints
This page was built for publication:
