Approximation algorithm for the uniform bounded facility problem

Authors:
Kerui Weng
Affiliations:
School of Economy and Management, China University of Geosciences, Wuhan, P.R. China
Venue:
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Year:
2011

Citing 11
Cited 0

Approximation algorithms for facility location problems (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Algorithms for facility location problems with outliers

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
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
Improved Combinatorial Algorithms for Facility Location Problems

SIAM Journal on Computing
Approximation Algorithms for Metric Facility Location Problems

SIAM Journal on Computing
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
A 5+epsilon (Porson)-approximation algorithm for minimum weighted dominating set in unit disk graph

Theoretical Computer Science
Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs

APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
The approximation gap for the metric facility location problem is not yet closed

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The uniform bounded facility location problem (UBFLP) seeks to the optimal way of locating facilities to minimize total costs (opening costs plus routing costs), while the maximal routing costs of all clients are at most a given bound d. After building a mixed 0-1 integer programming model for UBFLP, the paper gives ln n+1-approximation algorithm for UBFLP on general graph. Then, we present the first constant-factor approximation algorithm with an approximation guarantee of 6.853+ε for UBFLP on plane, which is composed of the algorithm by Dai and Yu [1] and the schema of Xu and Xu [2].