The complexity of routing with collision avoidance (Q1741493)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of routing with collision avoidance |
scientific article; zbMATH DE number 7050898
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of routing with collision avoidance |
scientific article; zbMATH DE number 7050898 |
Statements
The complexity of routing with collision avoidance (English)
0 references
3 May 2019
0 references
NP-hardness
0 references
shared edges
0 references
dynamic flows
0 references
many-one reduction
0 references
0 references
0.9698968
0 references
0.89179826
0 references
0.89179826
0 references
0.88774586
0 references
0.88774586
0 references
0 references
0.86723363
0 references
0.8649354
0 references
