Lower-bounded facility location
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
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
Capacitated domination problem
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Lower-bounded facility location
ACM Transactions on Algorithms (TALG)
An approximation algorithm for the k-level capacitated facility location problem
Journal of Combinatorial Optimization
A primal-dual approximation algorithm for the k-level stochastic facility location problem
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Approximation Algorithms for Multicommodity Facility Location Problems
SIAM Journal on Discrete Mathematics
Journal of Global Optimization
Generalized machine activation problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved approximation algorithms for the robust fault-tolerant facility location problem
Information Processing Letters
Dynamic service placement in shared service hosting infrastructures
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
A 3-approximation for facility location with uniform capacities
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
An approximation algorithm for the k-level stochastic facility location problem
Operations Research Letters
A cost-sharing method for an economic lot-sizing game
Operations Research Letters
Approximation algorithm for facility location with service installation costs
Operations Research Letters
A 5-approximation for capacitated facility location
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
A Local Heuristic for Latency-Optimized Distributed Cloud Deployment
UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing
| Hi-index | 0.01 |
We present a multiexchange local search algorithm for approximating the capacitated facility location problem (CFLP), where a new local improvement operation is introduced that possibly exchanges multiple facilities simultaneously. We give a tight analysis for our algorithm and show that the performance guarantee of the algorithm is between 3+2v2-e and 3+2v2+e for any given constant e0. The previously known best approximation ratio for the CFLP is 7.88, as shown by Mahdian and P脙隆l (2003. Universal facility location.Proc. 11th Annual Eur. Sympos. Algorithms (ESA), 409--421), based on the operations proposed by P脙隆l et al. (2001. Facility location with hard capacities.Proc. 42nd IEEE Sympos. Foundations Comput. Sci. (FOCS), 329--338). Our upper bound 3+2v2+e also matches the best-known ratio, obtained by Chudak and Williamson (1999.Improved approximation algorithm for capacitated facility location problems. Proc. 7th Conf. Integer Programming Combin. Optim. (IPCO), 99--113), for the CFLP with uniform capacities. In order to obtain the tight bound of our new algorithm, we make interesting use of the notion of exchange graph of P脙隆l et al. and techniques from the area of parallel machine scheduling.