A new approximation algorithm for the multilevel facility location problem
Redirect to Publisher's version
(Publisher's version.url.txt, 43 bytes)
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP-rounding. The linear program that we use has a polynomial number of variables and constraints, thus being more efficient than the one commonly used in the approximation algorithms for these types of problems.