On the complexity of compressing two dimensional routing tables with order (Q1702127)
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 compressing two dimensional routing tables with order |
scientific article; zbMATH DE number 6844602
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of compressing two dimensional routing tables with order |
scientific article; zbMATH DE number 6844602 |
Statements
On the complexity of compressing two dimensional routing tables with order (English)
0 references
28 February 2018
0 references
routing
0 references
routing tables
0 references
order
0 references
priority
0 references
software defined networks
0 references
complexity
0 references
approximation algorithm
0 references
compact tables
0 references
0 references
0.9078176021575928
0 references
0.7735813856124878
0 references
0.7182426452636719
0 references
0.7067370414733887
0 references
