FPT approximation for fair minimum-load clustering
From MaRDI portal
Cites work
- A complete anytime algorithm for number partitioning
- A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)
- A local search approximation algorithm for \(k\)-means clustering
- A unified framework for clustering constrained data without locality property
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- An application of simultaneous diophantine approximation in combinatorial optimization
- An approximation algorithm for the generalized assignment problem
- Approximating k-median via pseudo-approximation
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximation algorithms for minimum-load \(k\)-facility location
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Approximations for minimum and min-max vehicle routing problems
- Clustering to minimize the maximum intercluster distance
- FPT Approximation for Constrained Metric k-Median/Means
- Faster algorithms for the constrained k-means problem
- Integer Programming with a Fixed Number of Variables
- Local Search Heuristics for k-Median and Facility Location Problems
- Minkowski's Convex Body Theorem and Integer Programming
- On the cost of essentially fair clusterings
- On the fixed-parameter tractability of capacitated clustering
- Parameterized algorithms
- Privacy preserving clustering with constraints
Cited in
(3)
This page was built for publication: FPT approximation for fair minimum-load clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969008)
