A note on the \(k\)-Canadian traveller problem (Q963338): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2007.10.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2092129437 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Shortest paths without a map / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4223058 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3138961 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new measure for the study of on-line algorithms / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:31, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the \(k\)-Canadian traveller problem |
scientific article |
Statements
A note on the \(k\)-Canadian traveller problem (English)
0 references
19 April 2010
0 references
routing
0 references
on-line algorithms
0 references
competitiveness
0 references
