Polynomial-time approximation schemes for geometric min-sum median clustering
From MaRDI portal
Publication:3196638
DOI10.1145/506147.506149zbMath1323.68574OpenAlexW2157795846MaRDI QIDQ3196638
Yuval Rabani, Rafail Ostrovsky
Publication date: 30 October 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/506147.506149
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (10)
Parameterized complexity of categorical clustering with size constraints ⋮ Unnamed Item ⋮ Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings ⋮ Parameterized low-rank binary matrix approximation ⋮ A Streaming Algorithm for k-Means with Approximate Coreset ⋮ Local Search Yields a PTAS for $k$-Means in Doubling Metrics ⋮ Parameterized complexity of categorical clustering with size constraints ⋮ Parameterized Low-Rank Binary Matrix Approximation ⋮ Low-Rank Binary Matrix Approximation in Column-Sum Norm. ⋮ Tight Embeddability of Proper and Stable Metric Spaces
This page was built for publication: Polynomial-time approximation schemes for geometric min-sum median clustering
