Approximating the traffic grooming problem (Q1018099)
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: Approximating the traffic grooming problem |
scientific article; zbMATH DE number 5553600
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the traffic grooming problem |
scientific article; zbMATH DE number 5553600 |
Statements
Approximating the traffic grooming problem (English)
0 references
13 May 2009
0 references
wavelength assignment
0 references
wavelength division multiplexing (WDM)
0 references
optical networks
0 references
add-drop multiplexer (ADM)
0 references
traffic grooming
0 references
0.9980840682983398
0 references
0.915855348110199
0 references
0.9030799865722656
0 references
0.9025481939315796
0 references
0.9018124938011168
0 references
