A 2-approximation algorithm for the soft-capacitated facility location problem

37Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper is divided into two parts. In the first part of this paper, we present a 2-approximation algorithm for the soft-capacitated facility location problem. This achieves the integrality gap of the natural LP relaxation of the problem. The algorithm is based on an improved analysis of an algorithm for the linear facility location problem, and a bifactor approximate-reduction from this problem to the soft-capacitated facility location problem. We will define and use the concept of bifactor approximate reductions to improve the approximation factor of several other variants of the facility location problem. In the second part of the paper, we present an alternative analysis of the authors' 1.52-approximation algorithm for the uncapacitated facility location problem, using a single factor-revealing LP. This answers an open question of [16]. Furthermore, this analysis, combined with a recent result of Thorup [21] shows that our algorithm can be implemented in quasi-linear time, achieving the best known approximation factor in the best possible running time. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Mahdian, M., Ye, Y., & Zhang, J. (2003). A 2-approximation algorithm for the soft-capacitated facility location problem. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2764, 129–140. https://doi.org/10.1007/978-3-540-45198-3_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free