Effective Heuristic Techniques for Combined Robust Clustering Problem

DOI10.1142/s0217595922400097OpenAlexW4210901693WikidataQ113343364 ScholiaQ113343364MaRDI QIDQ6053497

Unnamed Author, Lu Han, Ling Gai, Chen-Chen Wu

Publication date: 19 October 2023

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595922400097

zbMATH Keywords

approximation algorithm\(k\)-meanslocal search schemerobust clustering problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Robustness in mathematical programming (90C17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local search algorithm for universal facility location problem with linear penalties
• A local search approximation algorithm for \(k\)-means clustering
• NP-hardness of Euclidean sum-of-squares clustering
• On approximate geometric \(k\)-clustering
• A constant-factor approximation algorithm for the \(k\)-median problem
• A constant FPT approximation algorithm for hard-capacitated \(k\)-means
• The seeding algorithm for \(k\)-means problem with penalties
• An improved approximation algorithm for the \(k\)-means problem with penalties
• A local search approximation algorithm for the \(k\)-means problem with penalties
• Improved approximation algorithm for universal facility location problem with linear penalties
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• The Planar k-Means Problem is NP-Hard
• A Bi-Criteria Approximation Algorithm for k-Means
• Local Search Heuristics for k-Median and Facility Location Problems
• Least squares quantization in PCM
• An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
• Constant approximation for k-median and k-means with outliers via iterative rounding
• Concept decompositions for large sparse text data using clustering

This page was built for publication: Effective Heuristic Techniques for Combined Robust Clustering Problem