Approximating the Canadian Traveller Problem with Online Randomization
Abstract In this paper, we study online algorithms for the Canadian Traveller Problem defined by Papadimitriou and Yannakakis in 1991. This problem involves a traveller who knows the entire road network in advance, and wishes to travel as quickly as possible from a source vertex s to a destination v...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer US,
2021-10-29T12:54:53Z.
|
| Subjects: | |
| Online Access: | Get fulltext |