A simple dual ascent algorithm for the multilevel facility location problem

We present a simple dual ascent method for the multilevel facility location problem which finds a solution within $6$ times the optimum for the uncapacitated case and within $12$ times the optimum for the capacitated one. The algorithm is deterministic and based on the primal-dual technique.