A. Bar-Noy and B. Schieber, "The Canadian Traveller Problem," in Proceedings of the second annual ACM-SIAM Symposium on Discrete Algorithms, 1991, pp. 261 -- 270. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Travelling Miser Problem - Breitgand, Raz, Shavitt (2002) (1 citation) (Correct)
....variant of the problem in which the values of link weight and delay functions become known only upon an arrival to a vertices or a link, and their future values are unknown. Very few studies of the on line variant of the problem exist. One special case is known as the Canadian Traveler Problem [12], 13] In this problem a certain finite number of link failures (modeled by infinite link weights) may occur with failed links either remaining faulty forever, or being recovered after a finite period of time, recovery time. A strictly positive constant delay is associated with every link when it ....
....a certain finite number of link failures (modeled by infinite link weights) may occur with failed links either remaining faulty forever, or being recovered after a finite period of time, recovery time. A strictly positive constant delay is associated with every link when it is not failed. In [12] a polynomial time strategy minimizing the total travel time from one vertices to another in such time dependent network was presented. The crucial assumption made in [12] was letting the link down time periods be smaller than the internodal delays. This allowed an elegant recursive solution. ....
[Article contains additional citation context not shown here]
Amotz Bar-Noy and Baruch Schieber, "The canadian traveller problem, " in Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San-Francisco, California, 1991, pp. 261 -- 270.
PAO* for Planning with Hidden State - Dave Ferguson Anthony (2004) (Correct)
No context found.
A. Bar-Noy and B. Schieber, "The Canadian Traveller Problem," in Proceedings of the second annual ACM-SIAM Symposium on Discrete Algorithms, 1991, pp. 261 -- 270.
On Generic Scalability Problems in Monitoring of Data.. - Breitgand (2003) (Correct)
No context found.
Amotz Bar-Noy and Baruch Schieber. The Canadian Traveller Problem. In Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 261 - 270, San-Francisco, California, 1991.
On Selected Topics in Management of Data Communication Networks: .. - Breitgand (2002) (Correct)
No context found.
Amotz Bar-Noy and Baruch Schieber. The canadian traveller problem. In Second Annual ACMSIAM Symposium on Discrete Algorithms (SODA), pages 261 - 270, San-Francisco, California, 1991.
The Travelling Miser Problem - David Breitgand Danny (2002) (1 citation) (Correct)
No context found.
Amotz Bar-Noy and Baruch Schieber, "The canadian traveller problem," in Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San-Francisco, California, 1991, pp. 261 -- 270.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC