A 5-approximation for capacitated facility location
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1342123
- LP-based approximation algorithms for capacitated facility location
- Improved approximation algorithms for capacitated facility location problems
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
- A 3-approximation algorithm for the facility location problem with uniform capacities
Cited in
(36)- Approximation algorithms for the transportation problem with market choice and related models
- Easy capacitated facility location problems, with connections to lot-sizing
- Bifactor approximation for location routing with vehicle and facility capacities
- LP-based approximation for uniform capacitated facility location problem
- A note on LP-based approximation algorithms for capacitated facility location problem
- \(\mathrm{M}^p\)UFLP: universal facility location problem in the \(p\)-th power of metric space
- Iterative partial rounding for vertex cover with hard capacities
- Improved local search for universal facility location
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- Respecting lower bounds in uniform lower and upper bounded facility location problem
- LP-based algorithms for capacitated facility location
- New approximation algorithms for the unsplittable capacitated facility location problem
- Integrality gaps for strengthened linear relaxations of capacitated facility location
- A 3-approximation algorithm for the facility location problem with uniform capacities
- Recent developments in approximation algorithms for facility location and clustering problems
- Privacy preserving clustering with constraints
- Constant factor approximation algorithm for uniform hard capacitated knapsack median problem
- A 5-approximation for universal facility location
- scientific article; zbMATH DE number 7651148 (Why is no real title available?)
- On the cost of essentially fair clusterings
- Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem
- scientific article; zbMATH DE number 7765379 (Why is no real title available?)
- Improved bounds for metric capacitated covering problems
- Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center
- Capacitated facility location with outliers/penalties
- FPT approximation for capacitated clustering with outliers
- Respecting lower bounds in uniform lower and upper bounded facility location problem
- Buy-at-bulk facility location on trees
- Towards a theoretical understanding of why local search works for clustering with fair-center representation
- Improved approximation algorithm for capacitated facility location with uniform facility cost
- Uniform capacitated facility location with outliers/penalties
- Capacitated facility location with outliers and uniform facility costs
- Capacitated facility location with outliers and uniform facility costs
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Centrality of trees for capacitated \(k\)-center
This page was built for publication: A 5-approximation for capacitated facility location
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912835)
