Approximation algorithms for robust clustering problems using local search techniques
From MaRDI portal
Publication:6636083
Cites work
- scientific article; zbMATH DE number 5764796 (Why is no real title available?)
- scientific article; zbMATH DE number 1775394 (Why is no real title available?)
- A bi-criteria approximation algorithm for \(k\)-means
- A constant-factor approximation algorithm for the k-median problem
- A dependent LP-rounding approach for the \(k\)-median problem
- A local search approximation algorithm for \(k\)-means clustering
- Algorithms for facility location problems with outliers. (Extended abstract)
- An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization
- An improved approximation algorithm for the \(k\)-means problem with penalties
- An improved local search algorithm for \(k\)-median
- Approximating \(k\)-median via pseudo-approximation
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximation schemes for clustering with outliers
- Constant approximation for \(k\)-median and \(k\)-means with outliers via iterative rounding
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Local Search Heuristics for k-Median and Facility Location Problems
- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics
- Local search algorithms for the red-blue median problem
- Local search approximation algorithms for the k-means problem with penalties
- Local search yields a PTAS for \(k\)-means in doubling metrics
- On approximate geometric \(k\)-clustering
This page was built for publication: Approximation algorithms for robust clustering problems using local search techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636083)
