On the complexity of equal shortest path routing (Q4565765)
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 equal shortest path routing |
scientific article; zbMATH DE number 6887362
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of equal shortest path routing |
scientific article; zbMATH DE number 6887362 |
Statements
On the complexity of equal shortest path routing (English)
0 references
13 June 2018
0 references
routing
0 references
\textsc{ospf-ecmp} protocol
0 references
maximum flow
0 references
NP-hard
0 references
approximation algorithms
0 references
shortest path
0 references
inverse shortest path
0 references
0.7996500134468079
0 references
0.7894529700279236
0 references
0.7870649695396423
0 references
0.765099048614502
0 references
0.7499956488609314
0 references
