Approximation algorithms for facility location problems with a special class of subadditive cost functions

Authors:
Adriana F. Gabor;Jan-Kees C. W. van Ommeren
Affiliations:
EURANDOM and Faculty of Mathematics and Computer Science, TUE, Eindhoven, The Netherlands;Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, The Netherlands
Venue:
Theoretical Computer Science - Algorithmic applications in management
Year:
2006

Citing 15
Cited 0

Fundamentals of queueing theory (2nd ed.).

Fundamentals of queueing theory (2nd ed.).
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

Journal of Algorithms
Optimal control of service for facility holding inventory

Computers and Operations Research
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 Metric Facility Location Problems

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP

Journal of the ACM (JACM)
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem

SIAM Journal on Computing
A constant factor approximation algorithm for the fault-tolerant facility location problem

Journal of Algorithms
Boosted sampling: approximation algorithms for stochastic optimization

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Facility location and the analysis of algorithms through factor-revealing programs

Facility location and the analysis of algorithms through factor-revealing programs
An approximation algorithm for a facility location problem with inventories and stochastic demands

AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
An approximation algorithm for a facility location problem with stochastic demands and inventories

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article we focus on approximation algorithms for facility location problems with subadditive costs. As examples of such problems, we present three facility location problems with stochastic demand and exponential servers, respectively inventory. We present a (1 + ε, 1)-reduction of the facility location problem with subadditive costs to the soft capacitated facility location problem, which implies the existence of a 2(1 + ε)-approximation algorithm. For a special subclass of subadditive functions, we obtain a 2-approximation algorithm by reduction to the linear cost facility location problem.