Complexity of Canadian traveler problem variants (Q386993): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: DBLP publication ID (P1635): journals/tcs/FriedSBW13, #quickstatements; #temporary_batch_1731530891435 |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Shortest paths without a map / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3138961 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Stochastic shortest path problems with recourse / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Canadian Traveller Problem and its competitive analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on the \(k\)-Canadian traveller problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Repeated-task Canadian Traveler Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/tcs/FriedSBW13 / rank | |||
Normal rank |
Latest revision as of 21:49, 13 November 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Complexity of Canadian traveler problem variants |
scientific article |
Statements
Complexity of Canadian traveler problem variants (English)
0 references
11 December 2013
0 references
Canadian traveler problem
0 references
complexity of navigation under uncertainty
0 references
stochastic shortest path with recourse
0 references