An improved \((1+1)\) evolutionary algorithm for \(k\)-Median clustering problem with performance guarantee

DOI10.1016/j.physa.2019.122992OpenAlexW2978179071MaRDI QIDQ2164835

Zhengxin Huang, Yuren Zhou, Xiaoyun Xia, Xinsheng Lai

Publication date: 17 August 2022

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2019.122992

zbMATH Keywords

clusteringperformance analysisevolutionary algorithmsruntime analysis\(K\)-Median problem

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Cites Work

• Clustering by Passing Messages Between Data Points
• A local search approximation algorithm for \(k\)-means clustering
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Approximating $k$-Median via Pseudo-Approximation
• A constant-factor approximation algorithm for the k -median problem (extended abstract)
• A Dependent LP-Rounding Approach for the k-Median Problem
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• A new greedy approach for facility location problems
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics
• Local Search Heuristics for k-Median and Facility Location Problems
• Approximate Local Search in Combinatorial Optimization
• Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems
• An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
• Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
• Local search heuristic for k-median and facility location problems
• STACS 2005

This page was built for publication: An improved \((1+1)\) evolutionary algorithm for \(k\)-Median clustering problem with performance guarantee