Designing overlay multicast networks for streaming
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Multicommodity facility location
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Online algorithms for network design
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Approximating k-median with non-uniform capacities
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Replicated Server Placement with QoS Constraints
IEEE Transactions on Parallel and Distributed Systems
Performance Guarantees of Local Search for Multiprocessor Scheduling
INFORMS Journal on Computing
Lower-bounded facility location
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Assignment problem in content distribution networks: unsplittable hard-capacitated facility location
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
ACM Transactions on Algorithms (TALG)
An improved approximation algorithm for vertex cover with hard capacities
Journal of Computer and System Sciences
An improved approximation algorithm for vertex cover with hard capacities
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
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
Budgeted red-blue median and its generalizations
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Approximation Algorithms for Multicommodity Facility Location Problems
SIAM Journal on Discrete Mathematics
AdCell: ad allocation in cellular networks
ESA'11 Proceedings of the 19th European conference on Algorithms
Generalized machine activation problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Multicommodity facility location under group Steiner access cost
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
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
Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location
ACM Transactions on Algorithms (TALG)
From stars to comets: Improved local search for universal facility location
Operations Research Letters
A 5-approximation for capacitated facility location
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
A suitable server placement for peer-to-peer live streaming
The Journal of Supercomputing
| Hi-index | 0.00 |
In this paper we give the first constant factor approximation algorithm for the Facility Location Problem with nonuniform, hard capacities. Facility location problems have received a great deal of attention in recent years. Approximation algorithms have been developed for many variants. Most of these algorithms are based on linear programming, but the LP techniques developed thus far have been unsuccessful in dealing with hard capacities.A local-search based approximation algorithm [11, 6] is known for the special case of hard but uniform capacities. We present a local-search heuristic that yields an approximation guarantee of 9 + \varepsilon for the case of nonuniform hard capacities. To obtain this result we introduce new operations that are natural in this context. Our proof is based on network flow techniques.