Approximation algorithm for facility location with service installation costs

Authors:
Dachuan Xu;Shuzhong Zhang
Affiliations:
Department of Applied Mathematics, Beijing University of Technology, 100 Pingleyuan, Chaoyang District, Beijing 100022, PR China;Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, Hong Kong
Venue:
Operations Research Letters
Year:
2008

Citing 16
Cited 2

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
A 3-approximation algorithm for the k-level uncapacitated facility location problem

Information Processing Letters
Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation

Journal of the ACM (JACM)
A new greedy approach for facility location problems

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem

SIAM Journal on Computing
Facility location with Service Installation Costs

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem

SIAM Journal on Discrete Mathematics
Improved Combinatorial Algorithms for Facility Location Problems

SIAM Journal on Computing
A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem

Mathematics of Operations Research
Approximating the two-level facility location problem via a quasi-greedy approach

Mathematical Programming: Series A and B
Approximation Algorithms for Metric Facility Location Problems

SIAM Journal on Computing
The approximation gap for the metric facility location problem is not yet closed

Operations Research Letters
The k-level facility location game

Operations Research Letters
A note on the maximization version of the multi-level facility location problem

Operations Research Letters

A Cost-Sharing Method for the Soft-Capacitated Economic Lot-Sizing Game

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
An approximation algorithm for the k-level capacitated facility location problem

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the uncapacitated facility location problem with service installation costs depending on the type of service required. We propose a polynomial-time approximation algorithm with approximation ratio 1.808 which improves the previous approximation ratio of 2.391 of Shmoys, Swamy, and Levi.