Approximation algorithms for the lower-bounded \(k\)-median and its generalizations
From MaRDI portal
Publication:2019514
DOI10.1007/978-3-030-58150-3_51OpenAlexW3082506605MaRDI QIDQ2019514
Chunlin Hao, Zhenning Zhang, Lu Han, Chen-Chen Wu
Publication date: 21 April 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-58150-3_51
Related Items (4)
Improved parameterized approximation for balanced \(k\)-median ⋮ Approximation algorithms for the lower bounded correlation clustering problem ⋮ Respecting lower bounds in uniform lower and upper bounded facility location problem ⋮ On parameterized approximation algorithms for balanced clustering
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme
- An improved approximation algorithm for knapsack median using sparsification
- A constant-factor approximation algorithm for the \(k\)-median problem
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A new approximation algorithm for the \(k\)-facility location problem
- Approximating $k$-Median via Pseudo-Approximation
- Improved Approximation Guarantees for Lower-Bounded Facility Location
- Achieving anonymity via clustering
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- A new greedy approach for facility location problems
- Local Search Heuristics for k-Median and Facility Location Problems
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- On Facility Location with General Lower Bounds
This page was built for publication: Approximation algorithms for the lower-bounded \(k\)-median and its generalizations
