Clustering for edge-cost minimization (extended abstract)

DOI10.1145/335305.335373zbMath1296.68197OpenAlexW2081605725MaRDI QIDQ3192024

Leonard J. Schulman

Publication date: 26 September 2014

Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/335305.335373

Mathematics Subject Classification ID

Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (14)

Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median ⋮ Smoothed Analysis of the Squared Euclidean Maximum-Cut Problem ⋮ A nonlinear approach to dimension reduction ⋮ Database-friendly random projections: Johnson-Lindenstrauss with binary coins. ⋮ Analysis of set-up time models: a metric perspective ⋮ Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median ⋮ Dimensionality reduction with subgaussian matrices: a unified theory ⋮ Small space representations for metric min-sum \(k\)-clustering and their applications ⋮ Correlation clustering in general weighted graphs ⋮ Geometric component analysis and its applications to data analysis ⋮ Sublinear‐time approximation algorithms for clustering via random sampling ⋮ Least-distortion Euclidean embeddings of graphs: Products of cycles and expanders ⋮ Unnamed Item ⋮ Experiments with a Non-convex Variance-Based Clustering Criterion

This page was built for publication: Clustering for edge-cost minimization (extended abstract)