Testing of Clustering

DOI10.1137/S0036144503437178zbMath1105.68050OpenAlexW1968785071MaRDI QIDQ4652253

Michal Parnas, Seannie Dar, Dana Ron, Noga Alon

Publication date: 25 February 2005

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0036144503437178

zbMATH Keywords

clusteringapproximation algorithmsrandomized algorithmsproperty testing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (2)

An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions ⋮ Testing subgraphs in directed graphs

This page was built for publication: Testing of Clustering