Improved Approximation Algorithm for k-level Uncapacitated Facility Location Problem (with Penalties)
Open Access
- 4 November 2014
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 58 (1) , 19-44
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A 1.488 approximation algorithm for the uncapacitated facility location problemInformation and Computation, 2013
- Inapproximability of the Multi-level Uncapacitated Facility Location Problem2012
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location ProblemSIAM Journal on Computing, 2010
- Approximation algorithms for supply chain planning and logistics problems with market choiceMathematical Programming, 2009
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LPJournal of the ACM, 2003
- Improved Approximation Algorithms for the Uncapacitated Facility Location ProblemSIAM Journal on Computing, 2003
- An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem2002
- A 3-approximation algorithm for the -level uncapacitated facility location problemInformation Processing Letters, 1999
- Greedy Strikes Back: Improved Facility Location AlgorithmsJournal of Algorithms, 1999
- Approximation algorithms for facility location problems (extended abstract)1997