Constant-factor approximation algorithms for some maximin multi-clustering problems

DOI10.1007/978-3-031-35305-5_6zbMath1528.90279OpenAlexW4381956509MaRDI QIDQ6134049

Vladimir Khandeev, Sergey Neshchadim

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_6

zbMATH Keywords

clusteringapproximation algorithmEuclidean spaceNP-hardnessmax-min problembounded scatter

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• NP-hardness of Euclidean sum-of-squares clustering
• Clustering to minimize the maximum intercluster distance
• Approximation algorithms for geometric median problems
• On the complexity of some quadratic Euclidean partition problems into balanced clusters
• Outlier Analysis
• Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems

This page was built for publication: Constant-factor approximation algorithms for some maximin multi-clustering problems