On the complexity and algorithm of grooming regular traffic in WDM optical networks (Q436806)
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 6059790
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity and algorithm of grooming regular traffic in WDM optical networks |
scientific article; zbMATH DE number 6059790 |
Statements
On the complexity and algorithm of grooming regular traffic in WDM optical networks (English)
0 references
26 July 2012
0 references
traffic grooming
0 references
SONET/WDM networks
0 references
graph partition
0 references
NP-completeness
0 references
approximation algorithm
0 references
0.874962329864502
0 references
0.8371156454086304
0 references
0.8364437222480774
0 references
0.8341379165649414
0 references
