The complexity of routing in~hierarchical PNNI networks (Q374679)
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 6218673
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of routing in~hierarchical PNNI networks |
scientific article; zbMATH DE number 6218673 |
Statements
The complexity of routing in~hierarchical PNNI networks (English)
0 references
24 October 2013
0 references
hierarchical routing
0 references
telecommunications
0 references
nonlinear duality
0 references
geometric programming
0 references
shortest path
0 references
0 references
0.7551687955856323
0 references
0.7530326247215271
0 references
0.7280872464179993
0 references
0.7158778309822083
0 references
