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 the normal view instead:
scientific article; zbMATH DE number 7238557
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved deterministic strategy for the Canadian Traveller Problem exploiting small max-\((s,t)\)-cuts |
scientific article; zbMATH DE number 7238557 |
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
0.9498437
0 references
0.90203404
0 references
0.8843534
0 references
0.88152707
0 references
0.87761843
0 references
0.8768076
0 references
0.87449634
0 references
0.86187863
0 references
0.8585336
0 references
0.85014737
0 references
