Approximation algorithms for data placement problems

SIAM Journal on Computing

Volumn 38, Issue 4, 2008, Pages 1411-1429

  Baev, Ivan ^a   Rajaraman, Rajmohan ^b   Swamy, Chaitanya ^c  

^a HEWLETT PACKARD COMPANY   (United States)

^b NORTHEASTERN UNIVERSITY   (United States)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Approximation algorithms; Data placement; Facility location; Linear programming

Indexed keywords

ARBITRARY NETWORKS; AVERAGE DATUMS; CACHE CAPACITIES; CAPACITY CONSTRAINTS; DATA OBJECTS; DATA PLACEMENT; DATA PLACEMENTS; FACILITY LOCATION; MULTICAST MESSAGES; OBJECT O; OPTIMAL SOLUTIONS; PROGRAMMING RELAXATIONS; REPLICATED DATUMS; STEINER TREES; STORAGE COSTS; TECHNICAL CHALLENGES; TOTAL COSTS; TOTAL LENGTHS;

ALGORITHMS; COSTS; FACILITIES; INTERCONNECTION NETWORKS; LINEAR PROGRAMMING; LINEARIZATION; OSMIUM; POLYNOMIAL APPROXIMATION; RETAIL STORES; TREES (MATHEMATICS); WIRELESS TELECOMMUNICATION SYSTEMS;

APPROXIMATION ALGORITHMS;

EID: 55249124781     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/080715421     Document Type: Article

References (42)

1. B. AWERBUCH, Y. BARTAL, AND A. FIAT, Heat & dump: Competitive distributed paging, in Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, 1993, pp. 22-31.
2. B. AWERBUCH, Y. BARTAL, AND A. FIAT, Distributed paging for general networks, J. Algorithms, 28 (1998), pp. 67-104.
3. I. D. BAEV AND R. RAJARAMAN, Approximation algorithms for data placement in arbitrary networks, in Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 661-670.
4. N. BANSAL, D. COPPERSMITH, AND M. SVIRIDENKO, Improved approximation algorithms for broadcast scheduling, in Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006, pp. 344-353.
5. Y. BARTAL, A. FIAT, AND Y. RABANI, Competitive algorithms for distributed data management. J. Comput. System Sci., 51 (1995), pp. 341-358.
6. J. BYRKA, 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, Springer, Berlin, 2007, pp. 29-43.
7. M. CHARIKAR, S. GUHA, É. TARDOS, AND D. B. SHMOYS, A constant-factor approximation algorithm for the k-median problem, J. Comput. System Sci., 65 (2002), pp. 129-149.
8. F. A. CHUDAK AND D. B. SHMOYS, Improved approximation algorithms for the uncapacitated facility location problem, SIAM J. Comput., 33 (2003), pp. 1-25.
9. F. A. CHUDAK AND D. P. WILLIAMSON, Improved approximation algorithms for capacitated facility location problems, Math. Program., 102 (2005), pp. 207-222.
10. L. DOWDY AND D. FOSTER, Comparative models of the file assignment problem, ACM Comput. Surv., 14 (1982), pp. 287-313.
11. L. FLEISCHER, M. X. GOEMANS, V. S. MIRROKNI, AND M. SVIRIDENKO, Tight approximation algorithms for maximum general assignment problems, in Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006, pp. 611-620.
12. B. GAVISH AND O. SHENG, Dynamic file migration in distributed computer systems, Comm. ACM, 33 (1990), pp. 177-189.
13. S. GUHA AND K. MUNAGALA, Improved algorithms for the data placement problem, in Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 106-107.
14. A. GUPTA, J. KLEINBERG, A. KUMAR, R. RASTOGI, AND B. YENER, Provisioning a virtual private network: A network design problem for multicommodity flow, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001, pp. 389-398.
15. A. GUPTA, A. KUMAR, AND T. ROUGUGARDEN, Simple and better approximation algorithms for network design, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 365-372.
16. A. HEDDAYA AND S. MIRDAD, Web Wave: Globally load balanced fully distributed caching of hot published documents, in Proceedings of the 17th International Conference on Distributed Computing Systems, IEEE Computer Society, Washington, DC, 1997, pp. 160-168.
17. K. JAIN, M. MAHDIAN, E. MARKAKIS, A. SABERI, AND V. VAZIRANI, Greedy facility location algorithms analyzed using dual-fitting with factor-revealing LP, J. ACM, 50 (2003), pp. 795-824.
18. K. JAIN AND V. V. VAZIRANI, Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation, J. ACM, 48 (2001), pp. 274-296.
19. M. KORUPOLU AND M. DAHLIN, Coordinated placement and replacement for large-scale distributed caches, in Proceedings of the IEEE Workshop on Internet Applications, 1999, pp. 62-71.
20. M. KORUPOLU, C. PLAXTON, AND R. RAJARAMAN, Placement algorithms for hierarchical cooperative caching, J. Algorithms, 38 (2001), pp. 260-302.
21. M. R. KORUPOLU, C. G. PLAXTON, AND R. RAJARAMAN, Analysis of a local search heuristic for facility location problems, J. Algorithms, 37 (2000), pp. 146-188.
22. C. KRICK, H. RÁCKE, AND M. WESTERMANN, Approximation algorithms for data management in networks, in Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, 2001, pp. 237-246.
23. A. LEFF, J. WOLF, AND P. YU, Replication algorithms in a remote caching architecture, IEEE Trans. Parallel Distrib. Syst., 4 (1993), pp. 1185-1204.
24. R. LEVI, R. ROUNDY, AND D. SHMOYS, Primal-dual algorithms for deterministic inventory problems, Math. Oper. Res., 31 (2006), pp. 267-284.
25. R. LEVI, D. SHMOYS, AND C. SWAMY, LP-based approximation algorithms for capacitated facility location, in Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 3064, Springer, Berlin, 2004, pp. 206-218.
26. J. H. LIN AND J. S. VITTER, z.epsi;-approximations with minimum packing constraint violation, in Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992, pp. 771-782.
27. B. MAGGS, F. MEYER AUF DER HEIDE, B. VÖCKING, AND M. WESTERMANN, Exploiting locality for data management in systems of limited bandwidth, in Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, 1997, pp. 284-293.
28. F. MEYER AUF DER HEIDE, B. VOCKING, AND M. WESTERMANN, Caching in networks, in Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 430-439.
29. A. MEYERSON, K. MUNAGALA, AND S. PLOTKIN, Web caching using access statistics, in Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 354-363.
30. M. PÁL, É. TARDOS, AND T. WEXLER, Facility location with nonuniform, hard capacities, in Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001, pp. 329-338.
31. M. RABINOVICH, I. RABINOVICH, R. RAJARAMAN, AND A. AGGARWAL, A dynamic object replication and migration protocol for an Internet hosting service, in Proceedings of the IEEE International Conference on Distributed Computing Systems, 1999, pp. 101-113.
32. R. RAVI AND F. S. SELMAN, Approximation algorithms for the traveling purchaser problem, and its variants in network design, in Algorithms - ESA '99, Lecture Notes in Comput. Sci. 1643, Springer, Berlin, 1999, pp. 29-40.
33. R. RAVI AND A. SINHA, Multicommodity facility location, in Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004, pp. 335-342.
34. D. B. SHMOYS, Approximation algorithms for facility location problems, in Approximation Algorithms for Combinatorial Optimization, Lecture Notes in Comput. Sci. 1913, Springer, Berlin, 2000, pp. 27-33.
35. D. B. SHMOYS, C. SWAMY, AND R. LEVI, Facility location with service installation costs, in Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004, pp. 1081-1090.
36. D. B. SHMOYS AND É. TARDOS, An approximation algorithm for the generalized assignment problem, Math. Programming, 62 (1993), pp. 461-474.
37. D. B. SHMOYS, É. TARDOS, AND K. I. AARDAL, Approximation algorithms for facility location problems, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997, pp. 265-274.
38. C. SWAMY, Algorithms for Data Placement Problems, manuscript, 2004.
39. C. SWAMY AND A. KUMAR, Primal-dual algorithms for connected facility location problems, Algorithmica, 40 (2004), pp. 245-269.
40. C. SWAMY AND D. B. SHMOYS, Fault-tolerant facility location, in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 735-736.
41. O. WOLFSON, S. JAJODIA, AND Y. HUANG, An adaptive data replication algorithm, ACM Trans, Database Syst., 22 (1997), pp. 255-314.
42. J. ZHANG, B. CHEN, AND Y. YE, A multi-exchange local search algorithm for the capacitated facility location problem, in Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 3064, Springer, Berlin, 2004, pp. 219-233.