The complexity of routing with few collisions (Q1679978)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6810959
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of routing with few collisions |
scientific article; zbMATH DE number 6810959 |
Statements
The complexity of routing with few collisions (English)
0 references
22 November 2017
0 references
0.9698968
0 references
0.90787417
0 references
0.90787417
0 references
0.8895236
0 references
0.8895236
0 references
0.88554275
0 references
0.88186264
0 references
0.8759198
0 references
0.87432086
0 references
0 references
