An approximation framework for bounded facility location problems
From MaRDI portal
Recommendations
- Approximation algorithms for bounded facility location problems
- Approximation algorithm for uniform bounded facility location problem
- scientific article; zbMATH DE number 1559542
- scientific article; zbMATH DE number 1670526
- Improved approximation guarantees for lower-bounded facility location
- Approximate the lower-bounded connected facility location problem
- Approximation schemes for \(k\)-facility location
- A survey on approximation algorithms for facility location problems
- An approximation algorithm for a large-scale facility location problem
- Bounding methods for facilities location algorithms
Cited in
(10)- Upper Bound for the Competitive Facility Location Problem with Quantile Criterion
- Borda winner in facility location problems on sphere
- Approximation of the competitive facility location problem with MIPs
- Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location
- Approximation algorithm for uniform bounded facility location problem
- Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems
- Approximation algorithm for the uniform bounded facility problem
- A localization property for facility-location problems with arbitrary norms
- Approximation algorithms for bounded facility location problems
- Approximate the lower-bounded connected facility location problem
This page was built for publication: An approximation framework for bounded facility location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1790991)