\(k\)-median/means with outliers revisited: a simple fpt approximation
From MaRDI portal
Publication:6591646
DOI10.1007/978-3-031-49193-1_22MaRDI QIDQ6591646
Yong Zhang, Yicheng Xu, Lu Han, Da-Chuan Xu, Xianrun Chen
Publication date: 22 August 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A local search approximation algorithm for \(k\)-means clustering
- Partitioning a graph into small pieces with applications to path transversal
- Approximating extent measures of points
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- A new greedy approach for facility location problems
- On coresets for k-means and k-median clustering
- Greedy Strikes Back: Improved Facility Location Algorithms
- Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
- Coresets for clustering in Euclidean spaces: importance sampling is nearly optimal
- On the Parameterized Complexity of Approximating Dominating Set
- Constant approximation for k-median and k-means with outliers via iterative rounding
- Losing Treewidth by Separating Subsets
- Towards optimal lower bounds for k-median and k-means coresets
- FPT Approximation for Constrained Metric k-Median/Means
- Breaching the 2 LMP approximation barrier for facility location with applications to \(k\)-median
This page was built for publication: \(k\)-median/means with outliers revisited: a simple fpt approximation
