Improved Approximation Algorithm for k-Level UFL with Penalties, a Simplistic View on Randomizing the Scaling Parameter

DOI10.1007/978-3-319-08001-7_8zbMath1417.68282arXiv1310.2386OpenAlexW2169331572MaRDI QIDQ3188868

Jaroslaw Byrka, Shanfei Li, Bartosz Rybicki

Publication date: 2 September 2014

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.2386

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (3)

Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties ⋮ Improved approximation algorithms for the facility location problems with linear/submodular penalties ⋮ Improved approximation algorithm for \(k\)-level uncapacitated facility location problem (with penalties)

This page was built for publication: Improved Approximation Algorithm for k-Level UFL with Penalties, a Simplistic View on Randomizing the Scaling Parameter