FPT approximation for capacitated sum of radii
From MaRDI portal
Cites work
- Approximate clustering via core-sets
- Approximate clustering via metric partitioning
- Approximation algorithms for clustering to minimize the sum of diameters
- Cluster analysis and mathematical programming
- Clustering to minimize the sum of cluster diameters
- Dynamic clustering to minimize the sum of radii
- FPT constant-approximations for capacitated clustering to minimize the sum of cluster radii
- scientific article; zbMATH DE number 867650 (Why is no real title available?)
- scientific article; zbMATH DE number 7651201 (Why is no real title available?)
- Improved polynomial-time approximations for clustering with minimum sum of radii or diameters
- On clustering to minimize the sum of radii
- On metric clustering to minimize the sum of radii
- On minimum sum of radii and diameters clustering
- The PCP theorem by gap amplification
Cited in
(6)- A fixed-parameter tractable approximation for capacitated k-supplier
- FPT approximations for fair k-min-sum-radii
- Constant FPT approximation algorithms for colorful sum of radii
- Parameterized approximation schemes for fair-range clustering
- Polynomial-time constant-approximation for fair sum-of-radii clustering
- Improved FPT approximation for sum of radii clustering with mergeable constraints
This page was built for publication: FPT approximation for capacitated sum of radii
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906364)
