On the competitive ratio for online facility location

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2719, Issue , 2003, Pages 637-652

  Fotakis, Dimitris ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

COMPETITIVE RATIO; DETERMINISTIC ALGORITHMS; FACILITY LOCATIONS; HIERARCHICAL DECOMPOSITIONS; OBLIVIOUS ADVERSARIES; OPTIMAL FACILITY LOCATION; POTENTIAL FUNCTION; RANDOMIZED ALGORITHMS;

LOCATION;

EID: 35248822119     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_51     Document Type: Article

References (18)

1. S. Albers and H. Koga. New online algorithms for the page replication problem. J. of Algorithms, 27(1):75-96, 1998.
2. B. Awerbuch, Y. Bartal, and A. Fiat. Competitive distributed file allocation. Proc. of STOC '93, pp. 164-173, 1993.
3. Y. Bartal. Probabilistic approximations of metric spaces and its algorithmic applications. Proc. of FOCS '96, pp. 184-193, 1996.
4. Y. Bartal, A. Fiat, and Y. Rabani. Competitive algorithms for distributed data management. J. of Computer and System Sciences, 51(3):341-358, 1995.
5. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
6. M. Charicar, C. Chekuri, T. Feder, and R. Motwani. Incremental clustering and dynamic information retrieval. Proc. of STOC '97, pages 626-635, 1997.
7. M. Charicar and R. Panigrahy. Clustering to minimize the sum of cluster diameters. Proc. of STOC '01, pages 1-10, 2001.
8. R. Fleischer and S. Seiden. New results for online page replication. Proc. of APPROX '00, LNCS 1913, pp. 144-154, 2000.
9. S. Guha. Approximation Algorithms for Facility Location Problems. PhD Thesis, Stanford University, 2000.
10. S. Guha and S. Khuller. Greedy strikes back: Improved facility location algorithms. Proc. of SODA '98, pp. 649-657, 1998.
11. M. Imase and B.M. Waxman. Dynamic Steiner tree problem. SIAM J. on Discrete Mathematics, 4(3):369-384, 1991.
12. K. Jain and V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. J. of the ACM, 48(2):274-296, 2001.
13. C. Lund, N. Reingold, J. Westbrook, and D.C.K. Yan. Competitive online algorithms for distributed data management. SIAM J. on Computing, 28(3):1086-1111, 1999.
14. M. Mahdian, Y. Ye, and J. Zhang. Improved approximation algorithms for metric facility location problems. Proc. of APPROX '02, LNCS 2462, pp. 229-242, 2002.
15. R.R. Mettu and G.G. Plaxton. The online median problem. Proc. of FOCS '00, pp. 339-348, 2000.
16. A. Meyerson. Online facility location. Proc. of FOCS '01, pp. 426-431, 2001.
17. D. Shmoys. Approximation algorithms for facility location problems. Proc. of APPROX '00, LNCS 1913, pp. 27-33, 2000.
18. D. Shmoys, E. Tardos, and K. Aardal. Approximation algorithms for facility location problems. Proc. of STOC '97, pp. 265-274, 1997.