On algorithm design for metrical task systems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1995, Pages 420-429

  Burley, William R ^a   Irani, Sandy ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; SET THEORY; TOPOLOGY;

ALGORITHM DESIGN; COMPETITIVE ALGORITHMS; COMPETITIVE RATIO; METRIC SPACES; METRICAL TASK SYSTEMS; ONLINE PROBLEMS; POLYNOMIAL-TIME ALGORITHMS; UNIFORM METRIC;

DESIGN;

EID: 84968419417     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Y. Bartal, A. Fiat, and Y. Rabani. Competitive algorithms for distributed data management. In Proc. of the 24th Symposium on Theory of Computation, pages 39-48, 1992.
2. D.L. Black, and D.D. Sleator. Competitive algorithms for replication and migration problems. Technical report CMU-CS-89-201, Carnegie-Mellon University, 1989.
3. A. Borodin, S. Irani, P. Raghavan, and B. Schieber. Competitive Paging with Locality of Reference. In Proc. 23rd Annual ACM Symposium on Theory of Computing, pages 249-259, 1991.
4. A. Borodin, N. Linial, and M. Saks. An optimal online algorithm for metrical task systems. In Journal of the ACM, Volume 39, 745-763, 1992.
5. M. Chrobak and L. Larmore. The server problem and on-line games. In On-Line algorithms: proceedings of a DIM ACS workshop. DIM ACS Series in Discrete Mathematics and Theoretical Computer Science, 7:1164, 1992.
6. M. Chrobak and L. Larmore. Metrical service systems: deterministic strategies. Technical report UCR-CS-93-1, Dept. of Computer Science, University of California, Riverside, 1993.
7. A. R. Karlin, M. S. Manasse, L. Rudolph, and D.D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):70-119, 1988.
8. M.S. Manasse, L.A. McGeoch, and D.D. Sleator. Competitive algorithms for server problems. Journal of Algorithms, 11:208-230, 1990.
9. M.S. Manasse, L.A. McGeoch, and D.D. Sleator. Competitive algorithms for on-line problems. In Proc. of the 20th Ann. ACM Symp. on Theory of Computing, pages 322-333, May 1988.
10. C.H. Papadimitriou and M. Yannakakis. Shortest paths without a map. Theoretical Computer Science, 84:127-150, 1991.
11. T. Schaefer. On the Complexity of Some Two-person Perfect-Information Games. Journal of Computer and System Sciences (1), pages 185 - 225 (1978).
12. D.D. Sleator, R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, Vol. 28, pages 202-208, February 1985.
13. D.D. Sleator, R.E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, Vol. 32, No. 3, pages 652-686, July 1985.
14. L. J. Stockmeyer, A. R. Meyer. Word problems requiring exponential time. In Fifth Annual Symposium on the Theory of Computing, pages 1 - 9, (1973).
15. J. Westbrook. Randomized algorithms for multiprocessor page migration. To appear in SIAM Journal on Computing. Preliminary version in Proceedings of the DIM ACS Workshop on On-line Algorithms, American Mathematical Society, DIMACS Series, Vol. 7, 1992.