An approximation algorithm for the k-level concentrator location problem
From MaRDI portal
Publication:408401
Recommendations
- scientific article; zbMATH DE number 2038706
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- An approximation algorithm for the \(k\)-level capacitated facility location problem
- Improved LP-rounding approximation algorithm for \(k\)-level uncapacitated facility location
- An approximation algorithm for the \(k\)-level stochastic facility location problem
Cites work
- scientific article; zbMATH DE number 1303557 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- scientific article; zbMATH DE number 1833402 (Why is no real title available?)
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- A new approximation algorithm for the multilevel facility location problem
- Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems
- Approximating the two-level facility location problem via a quasi-greedy approach
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
Cited in
(2)
This page was built for publication: An approximation algorithm for the \(k\)-level concentrator location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408401)