The influence of maximum \((s,t)\)-cuts on the competitiveness of deterministic strategies for the Canadian traveller problem (Q2680863)
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 7638361
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The influence of maximum \((s,t)\)-cuts on the competitiveness of deterministic strategies for the Canadian traveller problem |
scientific article; zbMATH DE number 7638361 |
Statements
The influence of maximum \((s,t)\)-cuts on the competitiveness of deterministic strategies for the Canadian traveller problem (English)
0 references
4 January 2023
0 references
Canadian traveller problem
0 references
online algorithms
0 references
maximum cuts
0 references
0 references
0 references
0 references
0.9634240865707396
0 references
0.8429616689682007
0 references
0.834811270236969
0 references
0.8332404494285583
0 references
0.8296663761138916
0 references
