Approximation algorithms for the squared metric k-level facility location problem
From MaRDI portal
Approximation algorithms for the squared metric \(k\)-level facility location problem
Recommendations
- A local search approximation algorithm for a squared metric \(k\)-facility location problem
- A local search approximation algorithm for a squared metric \(k\)-facility location problem
- An approximation algorithm for the squared metric dynamic facility location problem
- scientific article; zbMATH DE number 1947043
- Approximation algorithm for squared metric facility location problem with nonuniform capacities
Cited in
(6)- Improved approximation algorithms for solving the squared metric k-facility location problem
- Approximation algorithm for squared metric facility location problem with nonuniform capacities
- The approximation gap for the metric facility location problem is not yet closed
- An approximation algorithm for the squared metric dynamic facility location problem
- A local search approximation algorithm for a squared metric \(k\)-facility location problem
- A local search approximation algorithm for a squared metric \(k\)-facility location problem
This page was built for publication: Approximation algorithms for the squared metric \(k\)-level facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2983533)
