PTAS for \(p\)-means \(q\)-medoids \(r\)-given clustering problem

DOI10.1007/978-3-031-35305-5_9zbMath1528.90228OpenAlexW4381956304MaRDI QIDQ6134053

Artem V. Pyatkin

Publication date: 21 August 2023

Published in: Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-35305-5_9

zbMATH Keywords

clusteringPTAScentroid\(k\)-meansmedoid

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of a search for a subset of ``similar vectors
• NP-hardness of Euclidean sum-of-squares clustering
• NP-hardness of quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the cluster sizes
• On Grouping for Maximum Homogeneity
• Grouping Multidimensional Data
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Faster Scaling Algorithms for Network Problems
• An approximation scheme for a problem of search for a vector subset
• A 2-approximation polynomial algorithm for a clustering problem

This page was built for publication: PTAS for \(p\)-means \(q\)-medoids \(r\)-given clustering problem