scientific article; zbMATH DE number 7651201
From MaRDI portal
Publication:5874534
Cites work
- A Best Possible Heuristic for the k-Center Problem
- A constant-factor approximation algorithm for the k-median problem
- An approximation algorithm for uniform capacitated k-median problem with 1+ capacity violation
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- Approximating k-median with non-uniform capacities
- Approximating capacitated \(k\)-median with \((1 + \epsilon)k\) open facilities
- Capacitated covering problems in geometric spaces
- Clustering to minimize the maximum intercluster distance
- Clustering to minimize the sum of cluster diameters
- Constant approximation for k-median and k-means with outliers via iterative rounding
- Constant approximation for capacitated \(k\)-median with \((1+\epsilon)\)-capacity violation
- Constant-Factor FPT Approximation for Capacitated k-Median
- LP-based algorithms for capacitated facility location
- On metric clustering to minimize the sum of radii
- On minimum sum of radii and diameters clustering
- On the fixed-parameter tractability of capacitated clustering
- On uniform capacitated k-median beyond the natural LP relaxation
- Parameterized algorithms
- The Capacitated K-Center Problem
Cited in
(15)- Approximating fair \(k\)-min-sum-radii in Euclidean space
- FPT approximation for capacitated clustering with outliers
- A fixed-parameter tractable approximation for capacitated k-supplier
- FPT approximation for capacitated sum of radii
- Clustering under a knapsack constraint: parameterized approximation for the knapsack median problem
- Clustering with a knapsack constraint: parameterized approximation algorithms for the knapsack median problem
- Separating \(k\)-\textsc{Median} from the supplier version
- Achieving anonymity via weak lower bound constraints for k-median and k-means
- FPT approximations for fair k-min-sum-radii
- FPT approximation for capacitated sum of radii
- Constant FPT approximation algorithms for colorful sum of radii
- A parameterized approximation algorithm for the diversity-aware l-centrum problem
- Max-distance sparsification for diversification and 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:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874534)
