Shortest path with acceleration constraints: complexity and approximation algorithms (Q2082550): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q114227013, #quickstatements; #temporary_batch_1710884486334 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q114227013 / rank | |||
Normal rank | |||
Revision as of 23:03, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shortest path with acceleration constraints: complexity and approximation algorithms |
scientific article |
Statements
Shortest path with acceleration constraints: complexity and approximation algorithms (English)
0 references
4 October 2022
0 references
shortest path
0 references
speed planning
0 references
complexity
0 references
approximation algorithms
0 references
