@inproceedings{586dd6ef47e64a698db49101e1079407,
title = "A simple dual ascent algorithm for the multilevel facility location problem",
abstract = "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.",
author = "Adriana Bumb and Walter Kern",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001; 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 ; Conference date: 18-08-2001 Through 20-08-2001",
year = "2015",
language = "British English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "55--63",
editor = "Luca Trevisan and Klaus Jansen and Michel Goemans and Rolim, {Jose D. P.}",
booktitle = "Approximation, Randomization, and Combinatorial Optimization",
address = "Germany",
}