Improved LP-Rounding Approximation Algorithm for k-level Uncapacitated Facility Location
From MaRDI portal
Publication:2843244
DOI10.1007/978-3-642-31594-7_14zbMath1272.90019OpenAlexW40770742MaRDI QIDQ2843244
Bartosz Rybicki, Jaroslaw Byrka
Publication date: 12 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31594-7_14
Linear programming (90C05) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Related Items (8)
Two-level rectilinear Steiner trees ⋮ Approximation algorithms for \(k\)-level stochastic facility location problems ⋮ A combinatorial approximation algorithm for \(k\)-level facility location problem with submodular penalties ⋮ Integrated Supply Chain Management via Randomized Rounding ⋮ Approximation algorithms for the dynamic \(k\)-level facility location problems ⋮ Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach ⋮ Approximation algorithms for the robust/soft-capacitated 2-level facility location problems ⋮ Improved approximation algorithm for \(k\)-level uncapacitated facility location problem (with penalties)
This page was built for publication: Improved LP-Rounding Approximation Algorithm for k-level Uncapacitated Facility Location
