Online Algorithms

ACM Computing Surveys

Volumn 31, Issue , 1999, Pages 4-

  Albers, Susanne ^a   Leonardi, Stefano ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84992339059     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/333580.333583     Document Type: Article

References (41)

1. S. Albers. Better bounds for online scheduling. In Proc. 29th Annual ACM Symp. on Theory of Computing, 130-139, 1997.
2. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin and O. Waarts. On-line routing of virtual circuits with applications to load balancing and machine scheduling. Journal of the ACM, 44:486-504, 1997.
3. B. Awerbuch, Y. Azar and S. Plotkin. Throughput-competitive online routing. In 34th IEEE Symp. on Foundations of Computer Science, 32-40, 1993.
4. B. Awerbuch, Y. Bartal, A. Fiat and A. Rosen. Competitive non-preemptive call control. In Proc. of 5th ACM-SIAM Symp. on Discrete Algorithms, 312-320, 1994.
5. B. Awerbuch, R. Gawlick, T. Leighton and Y. Rabani. On-line admission control and circuit routing for high performance computing and communication. In Proc. of the 35th Annual IEEE Symp. on Foundations of Computer Science, 412-423, 1994.
6. Y. Azar, A. Broder and A. Karlin. On-line load balancing. Proc. 36th IEEE Symp. on Foundations of Computer Science, 218-225, 1992.
7. Y. Azar. On-line load balancing. In Online Algorithms: The State of the Art, edited by A. Fiat and G. Woeginger, Springer LNCS 1442, 178-195, 1998.
8. Y. Azar and L. Epstein. On-line load balancing with of temporary tasks on identical ma chines. In Proc. 5th Israeli Symp. on Theory of Computing and Systems, 119-125, 1997.
9. Y. Azar, B. Kalyanasundaram, S. Plotkin. K. Pruhs and O. Waarts. Online load balancing of temporary tasks. In Proc. of the 3rd Workshop on Algorithms and Data Structures, Springer LNCS, 119-130, 1993.
10. Y. Bartal, A. Fiat, H. Karloff and R. Vohra. New algorithms for an ancient scheduling problem. Journal of Computer and System Sciences, 51:359-366, 1995.
11. Y. Bartal, A. Fiat and S. Leonardi. Lower bounds for on-line graph problems with applica tion to on-line circuit and optical routing. In Proc. of the 28th ACM Symp. on Theory of Computing, 531-540, 1996.
12. Y. Bartal and S. Leonardi. On-line routing in all-optical networks. In Proc. of the 24th International Colloqium on Automata, Languages and Programming, Springer LNCS, Volume 1256, 516-526, 1997.
13. S. Ben-David, A. Borodin, R. M. Karp, G. Tardos and A. Wigderson. On the power of randomization in on-line algorithms. Aigorithmica, 11:2-14, 1994.
14. A. Blum. On-line algorithms in machine learning. In Online Algorithms: The State of the Art, edited by A. Fiat and G. Woeginger, Springer LNCS, Volume 1442, 306-325, 1998.
15. A. Borodin and R. El-Yaniv. Online computation and competitive analysis. Cambridge University Press, 1998.
16. A. Borodin, N. Linial and M. Saks. An optimal on-line algorithm for metrical task systems. Journal ofthe ACM, 39:745-763, 1992.
17. A. Borodin, S. Irani, P. Raghavan and B. Schieber. Competitive paging with locality of reference. In Proc. 23rd Annual ACM Symp. on Theory of Computing, 249-259, 1991.
18. N. Cesa-Bianchi, Y. Freund, D. P. Helbold, D. Haussler, R. E. Schapire and M. K. Warmuth. How to use expert advice. In Proc. 25th Annual ACM Symp. on Theory of Computing, 382-391, 1993.
19. A. Chou, J. Cooperstock, R. El Yaniv, M. Klugerman and T. Leighton. The statistical adversary allows optimal money-making trading strategies. In Proc. 6th Annual ACM-SIAM Symp. on Discrete Algorithms, 467-476, 1995.
20. A. Fiat and A. R. Karlin. Randomized and multipointer paging with locality of reference. In Proc. 27th Annual ACM Symp. on Theory of Computing, 626-634, 1995.
21. A. Fiat and Z. Rosen. Experimental studies of access graph based heuristics. In Proc. 8th ACM-SIAM Symp. on Discrete Algorithms, 1997.
22. J. Garay, I. S. Gopal, S. Kutten, Y. Mansour and M. Yung. Efficient online call control algorithms. In Proc. 2nd Israel Symp. on Theory of Computing and Systems, 285-293, 1993.
23. R. Gawlick, A. Kamath, S. Plotkin and K. Ramakrishnan. Routing and admission control of virtual circuits in general topology networks. Technical Report BL011212-940819-19TM AT&T Bell Laboratories, 1994.
24. T. Gormley and E. Torng. Bounded online problems. Manuscript, 1998.
25. R. L. Graham. Bounds for certain multiprocessor anomalies. Bell System Technical Journal, 45:1563-1581, 1966.
26. D. S. Hochbaum (Editor). Approximation Algorithms for NP-Hard Problems. PWS Pub lishing Company, 1997.
27. S. Irani, A. R. Karlin and S. Phillips. Strongly competitive algorithms for paging with locality of reference. In Proc. 3rd Annual ACM-SIAM Symp. on Discrete Algorithms, 228-236, 1992.
28. D. R. Karger, S. J. Phillips and E. Torng. A better algorithm for an ancient scheduling problem. Journal of Algorithms, 20: 400-430, 1996.
29. A. Karlin, M. Manasse, L. Rudolph and D. D. Sleator. Competitive snoopy caching, Algorithmica, 3:79-119, 1988.
30. J. Kleinberg and E. Tardos. Disjoint paths in densely embedded graphs. In Proc. of the 36th Annual IEEE Symp. on Foundations of Computer Science, 52-61, 1995.
31. E. Koutsoupias and C. H. Papadimitriou. Beyond competitive analysis. In Proc. 34th Annual Symp. on Foundations of Computer Science, 394-400, 1994.
32. S. Leonardi, A. Marchetti-Spaccamela, A. Presciutti and A. Rosen. On-line randomized call-control revisited. In Proc. of the 9th ACM-SIAM Symp. on Discrete Algorithms, 223-232, 1998.
33. S. Leonardi. On-line network routing. In Online Algorithms: The State of the Art, edited by A. Fiat and G. Woeginger, Springer LNCS, Volume 1442, 242-267, 1998.
34. N. Littlestone and M. K. Warmuth. The weighted majority algorithm. Information and Computation, 108:212-261, 1994.
35. M. S. Manasse, L. A. McGeoch and D. D. Sleator. Competitive algorithms for on-line problems. In Proc. 20th Annual ACM Symp. on Theory of Computing, 322-333, 1988.
36. R. Motwani, S. Phillips and E. Torng. Non-clearvoyant scheduling. Proc. 4th Annual ACMSIAM Symp. on Discrete Algorithms, 422-431, 1993.
37. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
38. P. Raghavan. A statistical adversary for on-line algorithms. In On-Line Algorithms, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 79-83, 1991.
39. J. Sgall. On-line scheduling. In Online Algorithms: The State of the Art, edited by A. Fiat and G. Woeginger, Springer LNCS, Volume 1442, 198-231, 1998.
40. D. Shmoys, J. Wein and D. P. Williamson. Scheduling parallel machines on-line. SIAM Journal on Computing 24:1313-1331, 1995.
41. D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202-208, 1985.