A semi brute-force search approach for (balanced) clustering

DOI10.1007/S00453-023-01158-4MaRDI QIDQ6185939zbMATH OpenFDO

Authors Yicheng Xu, Vincent Chau, Chenchen Wu, Yong Zhang, V. Zissimopoulos, Yifei Zou

Publication date 9 January 2024

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00453-023-01158-4

zbMATH Keywords

\(k\)-means\(k\)-means++balanced clusteringclusteringprobabilistic algorithm

Mathematics Subject Classification ID

Graph theory (05Cxx) Algorithms in computer science (68Wxx)

Cites work

• A constant FPT approximation algorithm for hard-capacitated \(k\)-means
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• scientific article; zbMATH DE number 6381735 (Why is no real title available?)
• Least squares quantization in PCM
• Network flows. Theory, algorithms, and applications.
• On the fixed-parameter tractability of capacitated clustering
• The effectiveness of Lloyd-type methods for the \(k\)-means problem
• The hardness of approximation of Euclidean k-means

Cited in

(3)

• An approximation algorithm for the parity-constrained k-supplier problem
• Robust facility leasing problem with penalties
• Parity-constrained k-supplier problem

This page was built for publication: A semi brute-force search approach for (balanced) clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6185939)