The following pages link to Testing of Clustering (Q4443096):
Displayed 12 items.
- Sublinear time algorithms for earth mover's distance (Q633770) (← links)
- Distribution-free connectivity testing for sparse graphs (Q926283) (← links)
- Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← links)
- Testing metric properties (Q1877548) (← links)
- Testing proximity to subspaces: approximate \(\ell_\infty\) minimization in constant time (Q2309471) (← links)
- Tolerant property testing and distance approximation (Q2507697) (← links)
- Helly-Type Theorems in Property Testing (Q4631011) (← links)
- Sublinear-time Algorithms (Q4933363) (← links)
- Testing Euclidean Spanners (Q4933382) (← links)
- Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction (Q5075781) (← links)
- On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing (Q5098771) (← links)
- On Approximating the Number of Relevant Variables in a Function (Q5894227) (← links)