FPT approximation for capacitated clustering with outliers

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Matroid and knapsack center problems
Centrality of trees for capacitated $k$-center
Fair coresets and streaming algorithms for fair $k$-means
Tight FPT approximation for constrained $k$-center and $k$-supplier
Algorithms for facility location problems with outliers. (Extended abstract)
A constant-factor approximation algorithm for the $k$-median problem (extended abstract)
A 5-Approximation for Capacitated Facility Location
Constant Factor Approximation for Capacitated k-Center with Outliers
An Improved Approximation Algorithm for the Hard Uniform Capacitated k-median Problem
A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation
On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
Approximation Algorithms for the Set Covering and Vertex Cover Problems
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
Constant-Factor FPT Approximation for Capacitated k-Median
Constant factor approximation algorithm for uniform hard capacitated knapsack median problem
Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
Approximation Schemes for Capacitated Clustering in Doubling Metrics
Constant approximation for k-median and k-means with outliers via iterative rounding
Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
A new coreset framework for clustering
Capacitated facility location with outliers/penalties
Breaching the 2 LMP approximation barrier for facility location with applications to $k$-median
Improved bi-point rounding algorithms and a golden barrier for $k$-median
FPT constant-approximations for capacitated clustering to minimize the sum of cluster radii

This page was built for publication: FPT approximation for capacitated clustering with outliers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6658317)