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
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Approximation algorithms for data placement in arbitrary networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximating min-sum k-clustering in metric spaces
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
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 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
Primal-dual algorithms for deterministic inventory problems
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Network design for information networks
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Facility location with hierarchical facility costs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Primal-Dual Algorithms for Deterministic Inventory Problems
Mathematics of Operations Research
A service location problem with QoS constraints
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Near-optimal dynamic replication in unstructured peer-to-peer networks
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Facility location with hierarchical facility costs
ACM Transactions on Algorithms (TALG)
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Placement of replicated tasks for distributed stream processing systems
Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems
Approximation Algorithms for Multicommodity Facility Location Problems
SIAM Journal on Discrete Mathematics
Traffic-redundancy aware network design
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Non-metric multicommodity and multilevel facility location
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Inventory and facility location models with market selection
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Approximation algorithm for facility location with service installation costs
Operations Research Letters
Hi-index | 0.00 |
We consider a generalization of the uncapacitated facility location problem which we call Facility Location with Service Installation Costs. We are given a set of facilities, F,a set of demands or clients D, and a set of services S. Each facility i has a facility opening cost fi, and we have a service installation cost of fli for every facility-service pair (i, l). Each client j in D requests a specific service g(j) ∈ S and the cost of assigning a client j to facility i is given by cij. We want to open a set of facilities, install services at the open facilities, and assign each client j to an open facility at which service g(j) is installed, so as to minimize the sum of the facility opening costs, the service installation costs and the client assignment costs.Our main result is a primal-dual 6-approximation algorithm under the assumption that there is an ordering on the facilities such that if i comes before i' in this ordering then for every service type l, fli ≤ fl i. This includes (as special cases) the settings where the service installation cost fli depends only on the service type l, or depends only on the location i. With arbitrary service installation costs, the problem becomes as hard as the set-cover problem. Our algorithm extends the algorithm of Jain & Vazirani [9] in a novel way. If the service installation cost depends only on the service type and not on the location, we give an LP rounding algorithm that attains an improved approximation ratio of 2.391. The algorithm combines both clustered randomized rounding [6] and the filtering based technique of [10, 14]. We also consider the k-median version of the problem where there is an additional requirement that at most k facilities may be opened. We use our primal-dual algorithm to give a constant-factor approximation for this problem when the service installation cost depends only on the service type.