Competitive algorithms for layered graph traversal
Authors:
- A. FiatAFA. Fiat
- D.P. FosterDFD.P. Foster
- H. KarloffHKH. Karloff
- Y. RabaniYRY. Rabani
- Y. RavidYRY. Ravid
- S. ViswanathanSVS. Viswanathan
- 9 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 288-297
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Competitive k-server algorithms2002
- An optimal on-line algorithm for metrical task systemJournal of the ACM, 1992
- Competitive paging algorithmsJournal of Algorithms, 1991
- Lower bounds for randomized k-server and motion-planning algorithms1991
- Random walks on weighted graphs, and applications to on-line algorithms1990
- Competitive algorithms for on-line problems1988
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- Algorithm 97: Shortest pathCommunications of the ACM, 1962
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- On a routing problemQuarterly of Applied Mathematics, 1958