An improved approximation algorithm for uncapacitated facility location problem with penalties

Authors:
Guang Xu;Jinhui Xu
Affiliations:
Department of Computer Science and Engineering, Stete University of New York at Buffalo, Buffalo, New York;Department of Computer Science and Engineering, Stete University of New York at Buffalo, Buffalo, New York
Venue:
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Year:
2005

Citing 15
Cited 0

e-approximations with minimum packing constraint violation (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Approximation algorithms for facility location problems (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Greedy strikes back: improved facility location algorithms

Journal of Algorithms
Analysis of a local search heuristic for facility location problems

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for a capacitated facility location problem

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for facility location problems with outliers

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation

Journal of the ACM (JACM)
Local search heuristic for k-median and facility location problems

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Improved Approximation Algorithms for Capacitated Facility Location Problems

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation algorithms for facility location problems

APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP

Journal of the ACM (JACM)
Approximating the two-level facility location problem via a quasi-greedy approach

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A constant factor approximation algorithm for the fault-tolerant facility location problem

Journal of Algorithms
An LP rounding algorithm for approximating uncapacitated facility location problem with penalties

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider an interesting variant of the facility location problem called uncapacitated facility location problem with penalties (UFLWP for short) in which each client is either assigned to an opened facility or rejected by paying a penalty. We present a 1.8526-approximation algorithm for the UFLWP problem. Our algorithm first enhances the primal-dual method for the UFLWP problem [3] so that outliers can be recognized more efficiently, and then applies a local search heuristic to further reduce the cost for serving those non-rejected clients.