On the complexity of quality of service routing (Q294629)
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: On the complexity of quality of service routing |
scientific article; zbMATH DE number 6594025
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of quality of service routing |
scientific article; zbMATH DE number 6594025 |
Statements
On the complexity of quality of service routing (English)
0 references
16 June 2016
0 references
computational complexity: NP-completeness
0 references
routing
0 references
shortest path
0 references
multiple constraints
0 references
0.88959455
0 references
0.8888033
0 references
0.88531953
0 references
0.8839389
0 references
