Approximation algorithms for robust clustering problems using local search techniques
From MaRDI portal
Publication:6636083
DOI10.1007/978-981-97-2340-9_17MaRDI QIDQ6636083FDOQ6636083
Authors: Chenchen Wu, Rolf H. Möhring, Yishui Wang, Dachuan Xu, Dongmei Zhang 
Publication date: 12 November 2024
Cites Work
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Algorithms for facility location problems with outliers. (Extended abstract)
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- A dependent LP-rounding approach for the \(k\)-median problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Local Search Heuristics for k-Median and Facility Location Problems
- An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization
- Local search algorithms for the red-blue median problem
- Approximating \(k\)-median via pseudo-approximation
- On approximate geometric \(k\)-clustering
- A constant-factor approximation algorithm for the \(k\)-median problem
- A local search approximation algorithm for \(k\)-means clustering
- An improved approximation algorithm for the \(k\)-means problem with penalties
- Local Search Yields a PTAS for $k$-Means in Doubling Metrics
- Approximation schemes for clustering with outliers
- Local search approximation algorithms for the \(k\)-means problem with penalties
- A bi-criteria approximation algorithm for \(k\)-means
- Constant approximation for \(k\)-median and \(k\)-means with outliers via iterative rounding
- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics
- An improved local search algorithm for \(k\)-median
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)
