Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
A multiplier adjustment method for the generalized assignment problem
Management Science
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Greedy strikes back: improved facility location algorithms
Journal of Algorithms
A PTAS for the multiple knapsack problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Analysis of a local search heuristic for facility location problems
Journal of Algorithms
Local search heuristic for k-median and facility location problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Approximation Algorithms for Metric Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Facility Location with Nonuniform Hard Capacities
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
Improved approximation algorithms for capacitated facility location problems
Mathematical Programming: Series A and B
Tight approximation algorithms for maximum general assignment problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Proceedings of the 17th international conference on World Wide Web
Design and deployment of a digital forensics service platform for online videos
MiFor '09 Proceedings of the First ACM workshop on Multimedia in forensics
Proactive data dissemination to mission sites
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Budgeted red-blue median and its generalizations
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Multi-VPN optimization for scalable routing via relaying
IEEE/ACM Transactions on Networking (TON)
Cost analysis on IPTV hosting service for 3rd party providers
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
Characterizing roles of front-end servers in end-to-end performance of dynamic content distribution
Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference
Euclidean prize-collecting steiner forest
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location
ACM Transactions on Algorithms (TALG)
New approximation algorithms for the unsplittable capacitated facility location problem
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Proactive data dissemination to mission sites
Wireless Networks
Hi-index | 0.00 |
In a Content Distribution Network (CDN), there are m servers storing the data; each of them has a specific bandwidth. All the requests from a particular client should be assigned to one server, because of the routing protocol used. The goal is to minimize the total cost of these assignments ---cost of each is proportional to the distance as well as the request size--- while the load on each server is kept below its bandwidth limit. When each server also has a setup cost, this is an unsplittable hard-capacitated facility location problem. As much attention as facility location problems have received, there has been no nontrivial approximation algorithm when we have hard capacities (i.e., there can only be one copy of each facility whose capacity cannot be violated) and demands are unsplittable (i.e., all the demand from a client has to be assigned to a single facility). We observe it is NP-hard to approximate the cost to within any bounded factor. Thus, for an arbitrary constant ε 0, we relax the capacities to a 1 + ε factor. For the case where capacities are almost uniform, we give a bicriteria O(log n, 1 + ε)-approximation algorithm for general metrics and a (1 + ε, 1 + ε)-approximation algorithm for tree metrics. A bicriteria (α, β)-approximation algorithm produces a solution of cost at most α times the optimum, while violating the capacities by no more than a β factor. We can get the same guarantee for non-uniform capacities if we allow quasipolynomial running time. In our algorithm, some clients guess the facility they are assigned to, and facilities decide the size of clients they serve. A straight-forward approach results in exponential running time. When costs do not satisfy metricity, we show that a 1.5 violation of capacities is necessary to obtain any approximation. It is worth noting that our results generalize bin packing (zero cost matrix and facility costs equal to one), knapsack (single facility with all costs being zero), minimum makespan scheduling for related machines (all costs being zero) and some facility location problems.