A 2-approximation polynomial algorithm for a clustering problem
From MaRDI portal
Publication:5263825
DOI10.1134/S1990478913040066zbMath1324.68244OpenAlexW2131416339MaRDI QIDQ5263825
Vladimir Khandeev, Alexander Kel'Manov
Publication date: 17 July 2015
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1990478913040066
computational complexityapproximation algorithmcluster analysisapproximation polynomialsearch for a vector subset
Learning and adaptive systems in artificial intelligence (68T05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items
Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems, Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem, An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors, Exact pseudopolynomial algorithms for a balanced 2-clustering problem, PTAS for \(p\)-means \(q\)-medoids \(r\)-given clustering problem, An approximation polynomial-time algorithm for a sequence bi-clustering problem, Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center, Easy NP-hardness Proofs of Some Subset Choice Problems, A randomized algorithm for two-cluster partition of a set of vectors
