An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths (Q2352354): Difference between revisions
From MaRDI portal
Created claim: DBLP publication ID (P1635): journals/jco/BenderW15, #quickstatements; #temporary_batch_1731461124002 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10878-013-9634-8 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-013-9634-8 / rank | |||
Normal rank | |||
Latest revision as of 03:54, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths |
scientific article |
Statements
An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths (English)
0 references
1 July 2015
0 references
competitive analysis
0 references
online algorithm
0 references
Canadian traveller problem
0 references
