Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location

ACM Transactions on Algorithms

Volumn 8, Issue 3, 2012, Pages

  Bateni, Mohammadhossein ^a   Hajiaghayi, Mohammadtaghi ^b  

^a GOOGLE INC   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Approximation algorithm; Facility location; Network; PTAS

Indexed keywords

ARBITRARY CONSTANTS; ASSIGNMENT PROBLEMS; BANDWIDTH LIMIT; BI-CRITERIA; BIN PACKING; CONNECTION-COSTS; CONTENT DISTRIBUTION NETWORKS; EXPONENTIAL RUNNING TIME; FACILITY LOCATION PROBLEM; FACILITY LOCATIONS; NP-HARD; PTAS; QUASI-POLY-NOMIAL; RUNNING TIME; SETUP COSTS; TOTAL COSTS;

BANDWIDTH; COSTS; NETWORKS (CIRCUITS); SITE SELECTION;

APPROXIMATION ALGORITHMS;

EID: 84864864465     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/2229163.2229164     Document Type: Article

References (39)

1. ALZOUBI, H. A., LEE, S., RABINOVICH, M., SPATSCHECK, O., AND DERMERWE, J. V. 2008. Anycast CDNs revisited. In Proceedings of the 17th International Conference on World Wide Web (WWW). ACM, New York, 277-286.
2. ARYA, V., GARG, N., KHANDEKAR, R., MUNAGALA, K., AND PANDIT, V. 2001. Local search heuristics for k-median and facility location problems. In Proceedings of the 33rd ACM Symposium on Theory of Computing (STOC). ACM, New York, 21-29. (Pubitemid 32865714)
3. BARTAL, Y. 1998. On approximating arbitrary metrices by tree metrics. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC). ACM, New York, 161-168.
4. BATENI, M., GERBER, A., HAJIAGHAYI, M., AND SEN, S. 2009. Multi-VPN optimization for scalable routing via relaying. In Proceedings of the 28th Annual Conference of the IEEE Communications Society (INFOCOM). IEEE Computer Society, Los Alamitos, CA, 2756-2760.
5. BATENI, M. AND HAJIAGHAYI, M. 2009. Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location. In Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete algorithms (SODA). SIAM, Philadelphia, PA, 805-814.
6. BYRKA, J. 2007. An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. In Proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX). Springer, New York, 29-43.
7. CHARIKAR, M. AND GUHA, S. 1999. Improved combinatorial algorithms for facility location and k-median problems. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, Los Alamitos, CA, 378-388. (Pubitemid 129306191)
8. CHEKURI, C. AND KHANNA, S. 2000. A PTAS for the multiple knapsack problem. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, Philadelphia, PA, 213-222.
9. CHEN, F., JOHNSON, M. P., BAR-NOY, A., FERMIN, I., AND PORTA, T. F. L. 2009. Proactive data dissemination to mission sites. In Proceedings of the 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON). IEEE Computer Society, Los Alamitos, CA.
10. CHUDAK, F. A. 1998. Improved approximation algorithms for uncapacited facility location. In Proceedings of Integer Programming and Combinatorial Optimization (IPCO). Springer, New York, 180-194. (Pubitemid 128093728)
11. CHUDAK, F. A. AND SHMOYS, D. B. 1998. Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Compute. 33, 1, 1-25.
12. CHUDAK, F. A. ANDWILLIAMSON, D. P. 2005. Improved approximation algorithms for capacitated facility location problems. Math. Program. 102, 2, Ser. A, 207-222. (Pubitemid 40878106)
13. FAKCHAROENPHOL, J., RAO, S., AND TALWAR, K. 2004. A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. 69, 3, 485-497.
14. FISHER, M. L., JAIKUMAR, R., AND VAN WASSENHOVE, L. N. 1986. A multiplier adjustment method for the generalized assignment problem. Manag. Sci. 32, 9, 1095-1103.
15. FLEISCHER, L., GOEMANS, M. X., MIRROKNI, V. S., AND SVIRIDENKO, M. 2006. Tight approximation algorithms for maximum general assignment problems. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm (SODA). SIAM, Philadelphia, PA, 611-620. (Pubitemid 43275282)
16. GIMADI, E. K. 1983. An effective algorithm for the solution of the location problem with service domains connected with respect to an acyclic network. Upravlyaemye Sistemy 23, 12-23.
17. GRISHUKHIN, V. P. 1994. On polynomial solvability conditions for the simplest plant location problem. Trans. Amer. Math. Soc. 2, 158, 37-46.
18. GUHA, S. AND KHULLER, S. 1999. Greedy strikes back: Improved facility location algorithms. J. Algor. 31, 228-248. (Pubitemid 129609603)
19. HOCHBAUM, D. S. AND SHMOYS, D. B. 1987. Using dual approximation algorithms for scheduling problems: Theoretical and practical results. J. ACM 34, 1, 144-162.
20. HOCHBAUM, D. S. AND SHMOYS, D. B. 1988. A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM J. Comput. 17, 3, 539-551.
21. HUI, W., YIN, H., AND LIN, C. 2009. Design and deployment of a digital forensics service platform for online videos. In Proceedings of the 1st ACM workshop on Multimedia in Forensics (MiFor). ACM, New York, 31-36.
22. JAIN, K., MAHDIAN, M., AND SABERI, A. 2002. A new greedy approach for facility location problem. In Proceedings of the 34rd ACM Symposium on Theory of Computing (STOC). ACM, New York, 731-740. (Pubitemid 35009436)
23. JAIN, K. AND VAZIRANI, V. V. 2001. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. J. ACM 48, 2, 274-296.
24. KORUPOLU, M. R., PLAXTON, C. G., AND RAJARAMAN, R. 2000. Analysis of a local search heuristic for facility location problems. J. Algor. 37, 1, 146-188.
25. KUEHN, A. AND HAMBURGER, M. 1963. A heuristic program for locating warehouses. Manag. Sci. 9, 643-666.
26. LENSTRA, J. K., SHMOYS, D. B., AND TARDOS, É. 1990. Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46, 3, (Ser. A), 259-271.
27. LEVI, R., SHMOYS, D. B., AND SWAMY, C. 2004. LP-based approximation algorithms for capacitated facility location. In Proceedings of Integer Programming and Combinatorial Optimization (IPCO). Springer, New York, 206-218.
28. LIN, J.-H. AND VITTER, J. S. 1992. ε-Approximations with minimum packing constraint violation. In Proceedings of the 24th ACM Symposium on Theory of Computing (STOC). ACM, New York, 771-782.
29. MAHDIAN, M., MARKAKIS, E., SABERI, A., AND VAZIRANI, V. V. 2001. A greedy facility location algorithm analyzed using dual fitting. In Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX). Springer, New York, 127-137. (Pubitemid 33325646)
30. MAHDIAN, M. AND PÁAL, M. 2003. Universal facility location. In Proceeding of 11th Annual European Symposium on Algorithms (ESA). Springer, New York, 409-421.
31. MAHDIAN, M., YE, Y., AND ZHANG, J. 2002. Improved approximation algorithms for metric facility location problems. In Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX). Springer, New York, 229-242.
32. PAÁL, M., TARDOS, É., AND WEXLER, T. 2001. Facility location with nonuniform hard capacities. In Proceedings of 42nd IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, Los Alamitos, CA, 329-338. (Pubitemid 33068393)
33. RELAN, V. AND SONAWANE, B. 2009. Multidimensional facility location problem in content distribution networks. http://userpages.umbc.edu/~relan1/ CMSC%20641%20Project%20Report.pdf.
34. ROSS, G. T. AND SOLAND, R. M. 1975. A branch and bound algorithm for the generalized assignment problem. Math. Program. 8, 91-103.
35. SHAH, R. AND FARACH-COLTON, M. 2002. Undiscretized dynamic programming: faster algorithms for facility location and related problems on trees. In Proceedings of the 13th annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, Philadelphia, PA, 108-115.
36. SHMOYS, D. B. 2000. Approximation algorithms for facility location problems. In Proceedings of Approximation Algorithms for Combinatorial Optimization (APPROX). Springer, New York, 27-33.
37. SHMOYS, D. B. AND TARDOS, É. 1993. An approximation algorithm for the generalized assignment problem. Math. Program. 62, 3, Ser. A, 461-474.
38. SHMOYS, D. B., TARDOS, E., AND AARDAL, K. I. 1997. Approximation algorithms for facility location problems. In Proceedings of the 29th ACM Symposium on Theory of Computing (STOC). ACM, New York, 265-274.
39. ZHANG, J., CHEN, B., AND YE, Y. 2004. A multi-exchange local search algorithm for the capacitated facility location problem. In Proceedings of Integer Programming and Combinatorial Optimization Conference (IPCO). Springer, New York, 219-233.