On the competitiveness of memoryless strategies for the \(k\)-Canadian traveller problem

DOI10.1007/978-3-030-04651-4_38OpenAlexW2901887370MaRDI QIDQ2327138

Julien Hemery, Pierre Bergé, Joanna Tomasik, Arpad Rimmel

Publication date: 11 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-04651-4_38

zbMATH Keywords

competitive analysisonline algorithmsCanadian traveller problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Approximating the Canadian traveller problem with online randomization ⋮ The influence of maximum \((s,t)\)-cuts on the competitiveness of deterministic strategies for the Canadian traveller problem ⋮ Canadian traveller problem with predictions

This page was built for publication: On the competitiveness of memoryless strategies for the \(k\)-Canadian traveller problem