Skip to main content
SpringerLink
Log in

Competitive analysis of algorithms

  • Chapter
  • First Online:
Online Algorithms

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1442))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Ben-David, A. Borodin, R.M. Karp, G. Tardos, and A. Wigderson. On the power of randomization in on-line algorithms. Algorithmica, 11:2–14, 1994.

    Article  Google Scholar 

  2. A. Borodin, N. Linial, and M. Saks. An optimal online algorithm for metrical task systems. In Proc. 19th Annual ACM Symposium on Theory of Computing, pages 373–382, 1987.

    Google Scholar 

  3. T.M. Cover. Universal portfolios. Mathematical Finance, 1(1):1–29, January 1991.

    Google Scholar 

  4. R. L. Graham. Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45:1563–1581, 1966.

    Google Scholar 

  5. D. S. Johnson. Near-optimal bin packing algorithms. PhD thesis, MIT, Cambridge, MA, 1973.

    Google Scholar 

  6. D. S. Johnson. Fast algorithms for bin packing. J. Comput. System Sci., 8:272–314, 1974.

    Google Scholar 

  7. D. S. Johnson. Private communication, 1998.

    Google Scholar 

  8. A. Karlin, M. Manasse, L. Rudolph, and D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):79–119, 1988.

    Article  MathSciNet  Google Scholar 

  9. H. A. Kierstead and W. T. Trotter. An extremal problem in recursive combinatorics. Congressus Numerantium, 33:143–153, 1981.

    Google Scholar 

  10. D.E. Knuth. The Art of Computer Programming; Volume 2: Seminumerical Algorithms. Addison-Wesley, 1st edition, 1968.

    Google Scholar 

  11. M. Manasse, L. A. McGeoch, and D. Sleator. Competitive algorithms for online problems. In Proc. 20th Annual ACM Symposium on Theory of Computing, pages 322–333, 1988.

    Google Scholar 

  12. C. H. Papadimitriou and M. Yannakakis. Shortest paths without a map. Theoretical Computer Science, 84:127–150, 1991.

    Article  Google Scholar 

  13. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202–208, 1985.

    Article  Google Scholar 

  14. Daniel D. Sleator and Robert Endre Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32:652–686, 1985.

    Article  Google Scholar 

  15. D. R. Woodall. The bay restaurant — a linear storage problem. American Mathematical Monthly, 81:240–246, 1974.

    Google Scholar 

  16. A. C. C. Yao. New algorithms for bin packing. J. Assoc. Comput. Mach., 27:207–227, 1980.

    Google Scholar 

Download references

Authors
  1. Amos Fiat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gerhard J. Woeginger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Amos Fiat Gerhard J. Woeginger

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Fiat, A., Woeginger, G.J. (1998). Competitive analysis of algorithms. In: Fiat, A., Woeginger, G.J. (eds) Online Algorithms. Lecture Notes in Computer Science, vol 1442. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029562

Download citation

  • DOI: https://doi.org/10.1007/BFb0029562

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64917-5

  • Online ISBN: 978-3-540-68311-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation