Approximation algorithms for robust clustering problems using local search techniques
From MaRDI portal
Publication:6636083
DOI10.1007/978-981-97-2340-9_17MaRDI QIDQ6636083
Yishui Wang, Chen-Chen Wu, Da-Chuan Xu, Dongmei Zhang, Rolf H. Möhring
Publication date: 12 November 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A local search approximation algorithm for \(k\)-means clustering
- Local search algorithms for the red-blue median problem
- On approximate geometric \(k\)-clustering
- A constant-factor approximation algorithm for the \(k\)-median problem
- An improved approximation algorithm for the \(k\)-means problem with penalties
- Local search approximation algorithms for the \(k\)-means problem with penalties
- Approximating $k$-Median via Pseudo-Approximation
- A Dependent LP-Rounding Approach for the k-Median Problem
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Local Search Yields a PTAS for $k$-Means in Doubling Metrics
- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics
- A Bi-Criteria Approximation Algorithm for k-Means
- Local Search Heuristics for k-Median and Facility Location Problems
- Approximation Schemes for Clustering with Outliers
- Constant approximation for k-median and k-means with outliers via iterative rounding
- An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization
- An improved local search algorithm for \(k\)-median
This page was built for publication: Approximation algorithms for robust clustering problems using local search techniques
