Competitive algorithms for layered graph traversal

This publication has 13 references indexed in Scilit:

• Competitive k-server algorithms
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• An optimal on-line algorithm for metrical task system
  Journal of the ACM, 1992
• Competitive paging algorithms
  Journal of Algorithms, 1991
• Lower bounds for randomized k-server and motion-planning algorithms
  Published by Association for Computing Machinery (ACM) ,1991
• Random walks on weighted graphs, and applications to on-line algorithms
  Published by Association for Computing Machinery (ACM) ,1990
• Competitive algorithms for on-line problems
  Published by Association for Computing Machinery (ACM) ,1988
• Amortized efficiency of list update and paging rules
  Communications of the ACM, 1985
• Algorithm 97: Shortest path
  Communications of the ACM, 1962
• A note on two problems in connexion with graphs
  Numerische Mathematik, 1959
• On a routing problem
  Quarterly of Applied Mathematics, 1958