The Canadian Traveller Problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1991, Pages 261-270

  Bar Noy, Amotz ^a   Schieber, Baruch ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEM RECOVERY; POLYNOMIAL APPROXIMATION; RECOVERY; ROADS AND STREETS; STOCHASTIC SYSTEMS; TRAFFIC CONTROL;

ADJACENT SITES; COMPETITIVE RATIO; POLYNOMIAL-TIME; PSPACE-COMPLETE; ROUTING PROBLEMS; ROUTING SCHEME; STOCHASTIC VARIATION; TIME COMPLEXITY;

TRAVEL TIME;

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

References (13)

1. S. Ben-David and A. Borodin. A new measure for the study of online algorithms, 1990. Manuscript.
2. R. A. Baeza-Yates, J. C. Culberson, and G. J. E. Rawlins. Searching with uncertainty. Technical Report CS-87-68, Computer Science Department, The University of Waterloo, October 1987.
3. M. O. Ball, B. L. Golden, and R. V. Vohra. Finding most vital arcs in a network. Operations Research Letters, 8:73-76, April 1989.
4. H. W. Corley and D. Y Sha. Most vital links and nodes in weighted networks. Operations Research Letters, 1:157-160, September 1982.
5. E. W. Dijkstra. A note on two problems in connexion with graphs. Numer. Math., 1:269-271, 1959.
6. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34:596-615, July 1987.
7. K. Malik, A. K. Mittal, and S. K. Gupta. Finding most vital arcs in a network. Operations Research Letters, 8:223-227, April 1989.
8. M. S. Manasse, L. A. McGeoch, and D. D. Sleator. Competitive algorithms for on-line problems. In Proc. of the 20th ACM Symp. on Theory of Computing, pages 322-333, Chicago, IL, May 1988.
9. J. M. McQuillan, I. Richer, and E. C. Rosen. The new routing algorithm for the ARPANET. IEEE Transactions on Communications, COM-28:711-719, May 1980.
10. M. Pease, R. E. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228-234, 1980.
11. C. H. Papadimitriou and M. Yannakakis. Shortest paths without a map. In Proc. 16th ICALP, Lect. Notes in Comp. Sci. No. 372, pages 610-620. Springer-Verlag, July 1989.
12. E. C. Rosen. The updating protocol of ARPANET'S new routing algorithm. Computer Networks, 4:11-19, February 1980.
13. D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202-208, 1985.