Improved approximation algorithm for k-level UFL with penalties, a simplistic view on randomizing the scaling parameter

@inproceedings{Byrka2013ImprovedAA,
title={Improved approximation algorithm for k-level UFL with penalties, a simplistic view on randomizing the scaling parameter},
author={Jaroslaw Byrka and Shanfei Li and Bartosz Rybicki},
booktitle={WAOA},
year={2013}
}

The state of the art in approximation algorithms for facility location problems are complicated combinations of various techniques. In particular, the currently best 1.488-approximation algorithm for the uncapacitated facility location (UFL) problem by Shi Li is presented as a result of a non-trivial randomization of a certain scaling parameter in the LP-rounding algorithm by Chudak and Shmoys combined with a primal-dual algorithm of Jain et al. In this paper we first give a simple… CONTINUE READING