On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem

Pierre Bergé, Julien Hemery, Arpad Rimmel, Joanna Tomasik. On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem. In Donghyun Kim 0001, R. N. Uma, Alexander Zelikovsky, editors, Combinatorial Optimization and Applications - 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings. Volume 11346 of Lecture Notes in Computer Science, pages 566-576, Springer, 2018. [doi]

@inproceedings{BergeHRT18-0,
  title = {On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem},
  author = {Pierre Bergé and Julien Hemery and Arpad Rimmel and Joanna Tomasik},
  year = {2018},
  doi = {10.1007/978-3-030-04651-4_38},
  url = {https://doi.org/10.1007/978-3-030-04651-4_38},
  researchr = {https://researchr.org/publication/BergeHRT18-0},
  cites = {0},
  citedby = {0},
  pages = {566-576},
  booktitle = {Combinatorial Optimization and Applications - 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings},
  editor = {Donghyun Kim 0001 and R. N. Uma and Alexander Zelikovsky},
  volume = {11346},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-04651-4},
}