An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths (Q2352354): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/jco/BenderW15, #quickstatements; #temporary_batch_1731461124002 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jco/BenderW15 / rank | |||
Normal rank | |||
Revision as of 02:45, 13 November 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
