Improved deterministic strategy for the Canadian Traveller Problem exploiting small max-\((s,t)\)-cuts

DOI10.1007/978-3-030-39479-0_3OpenAlexW3002320445MaRDI QIDQ2193076

Lou Salaün, Pierre Bergé

Publication date: 24 August 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-39479-0_3

zbMATH Keywords

competitive analysisonline algorithmsCanadian Traveller Problem

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (1)

The influence of maximum \((s,t)\)-cuts on the competitiveness of deterministic strategies for the Canadian traveller problem

This page was built for publication: Improved deterministic strategy for the Canadian Traveller Problem exploiting small max-\((s,t)\)-cuts