Testing of Clustering
From MaRDI portal
Publication:4443096
DOI10.1137/S0895480102410973zbMath1041.68048MaRDI QIDQ4443096
Michal Parnas, Noga Alon, Seannie Dar, Dana Ron
Publication date: 8 January 2004
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (12)
Testing metric properties ⋮ On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing ⋮ Sublinear time algorithms for earth mover's distance ⋮ Distribution-free connectivity testing for sparse graphs ⋮ Helly-Type Theorems in Property Testing ⋮ Testing Euclidean Spanners ⋮ Small space representations for metric min-sum \(k\)-clustering and their applications ⋮ Sublinear-time Algorithms ⋮ Tolerant property testing and distance approximation ⋮ On Approximating the Number of Relevant Variables in a Function ⋮ Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction ⋮ Testing proximity to subspaces: approximate \(\ell_\infty\) minimization in constant time
This page was built for publication: Testing of Clustering
