Improved deterministic strategy for the Canadian Traveller Problem exploiting small max-\((s,t)\)-cuts (Q2193076)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Improved deterministic strategy for the Canadian Traveller Problem exploiting small max-\((s,t)\)-cuts |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved deterministic strategy for the Canadian Traveller Problem exploiting small max-\((s,t)\)-cuts |
scientific article |
Statements
Improved deterministic strategy for the Canadian Traveller Problem exploiting small max-\((s,t)\)-cuts (English)
0 references
24 August 2020
0 references
Canadian Traveller Problem
0 references
competitive analysis
0 references
online algorithms
0 references
