An algorithm for the facility location problems

Authors:
Fengxian An;Zongyao Wang;Dongdong Wang
Affiliations:
Faculty of Mathematics and Physics, Huaiyin Institute of Technology, Huaian, China;Faculty of Mathematics and Physics, Huaiyin Institute of Technology, Huaian, China;Faculty of Mathematics and Physics, Huaiyin Institute of Technology, Huaian, China
Venue:
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 1
Year:
2010

Citing 11
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
Greedy strikes back: improved facility location algorithms

Proceedings of the ninth 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)
A new greedy approach for facility location problems

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem

SIAM Journal on Computing
Improved Combinatorial Algorithms for Facility Location Problems

SIAM Journal on Computing
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Variants of the facility location problem have been studied extensively in the operations research and management science literatures. In this paper, we present a new analysis method of a simple greedy algorithm for the uncapacitated facility location problem. We achieve an approximation guarantee of 1.5749 better than 1.853, which is the approximation ratio provided by the combinatorial approximation algorithm due to Charikar and Guha.