Approximation algorithms for the lower-bounded k-median and its generalizations
From MaRDI portal
(Redirected from Publication:2019514)
Approximation algorithms for the lower-bounded \(k\)-median and its generalizations
Approximation algorithms for the lower-bounded \(k\)-median and its generalizations
Cites work
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- scientific article; zbMATH DE number 2086926 (Why is no real title available?)
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A constant-factor approximation algorithm for the k-median problem
- A new approximation algorithm for the \(k\)-facility location problem
- A new greedy approach for facility location problems
- Achieving anonymity via clustering
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme
- An improved approximation algorithm for knapsack median using sparsification
- Approximating \(k\)-median via pseudo-approximation
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Improved approximation guarantees for lower-bounded facility location
- Local Search Heuristics for k-Median and Facility Location Problems
- Lower-bounded facility location
- On facility location with general lower bounds
Cited in
(14)- Approximating k-median via pseudo-approximation
- scientific article; zbMATH DE number 2165699 (Why is no real title available?)
- On parameterized approximation algorithms for balanced clustering
- On lower bounds for selecting the median
- An approximation algorithm for the \(k\)-median problem with uniform penalties via pseudo-solution
- Improved parameterized approximation for balanced \(k\)-median
- An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization
- scientific article; zbMATH DE number 7561535 (Why is no real title available?)
- An Approximation Algorithm for the k-Median Problem with Uniform Penalties via Pseudo-Solutions
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- Respecting lower bounds in uniform lower and upper bounded facility location problem
- scientific article; zbMATH DE number 1416475 (Why is no real title available?)
- Approximation algorithms for the lower bounded correlation clustering problem
- Better guarantees for \(k\)-median with service installation costs
This page was built for publication: Approximation algorithms for the lower-bounded \(k\)-median and its generalizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019514)
