Approximation algorithms for the lower-bounded k-median and its generalizations
From MaRDI portal
Publication:2019514
DOI10.1007/978-3-030-58150-3_51OpenAlexW3082506605MaRDI QIDQ2019514FDOQ2019514
Authors: Lu Han, Chunlin Hao, Zhenning Zhang, Chenchen Wu 
Publication date: 21 April 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-58150-3_51
Cites Work
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new approximation algorithm for the \(k\)-facility location problem
- Achieving anonymity via clustering
- A new greedy approach for facility location problems
- Improved approximation guarantees for lower-bounded facility location
- Lower-bounded facility location
- Local Search Heuristics for k-Median and Facility Location Problems
- Approximating \(k\)-median via pseudo-approximation
- A constant-factor approximation algorithm for the \(k\)-median problem
- An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme
- An improved approximation algorithm for knapsack median using sparsification
- On facility location with general lower bounds
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
Cited In (14)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- An Approximation Algorithm for the k-Median Problem with Uniform Penalties via Pseudo-Solutions
- Respecting lower bounds in uniform lower and upper bounded facility location problem
- Title not available (Why is that?)
- Approximating k-median via pseudo-approximation
- 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)
