Improved combinatorial approximation algorithms for the k-level facility location problem
From MaRDI portal
Improved combinatorial approximation algorithms for the \(k\)-level facility location problem
Recommendations
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- Improved approximation algorithms for multilevel facility location problems
- An approximation algorithm for the k-level capacitated facility location problem
- A combinatorial approximation algorithm for \(k\)-level facility location problem with submodular penalties
- Improved approximation algorithms for multilevel facility location problems
Cited in
(9)- Approximation algorithms for \(k\)-level stochastic facility location problems
- Approximating the two-level facility location problem via a quasi-greedy approach
- Improved approximation algorithm for k-level uncapacitated facility location problem (with penalties)
- An approximation algorithm for the k-level concentrator location problem
- Improved approximation algorithms for multilevel facility location problems
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- An approximation algorithm for the k-level capacitated facility location problem
- An approximation algorithm for the dynamic \(k\)-level facility location problem
- A new approximation algorithm for the multilevel facility location problem
This page was built for publication: Improved combinatorial approximation algorithms for the \(k\)-level facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449171)