Approximating the Traffic Grooming Problem in Tree and Star Networks (Q3522952)
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 in Tree and Star Networks |
scientific article; zbMATH DE number 5321100
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the Traffic Grooming Problem in Tree and Star Networks |
scientific article; zbMATH DE number 5321100 |
Statements
Approximating the Traffic Grooming Problem in Tree and Star Networks (English)
0 references
4 September 2008
0 references
optical networks
0 references
wavelength division multiplexing (WDM)
0 references
add-drop multiplexer (ADM)
0 references
traffic grooming
0 references
tree networks
0 references
0.99038017
0 references
0 references
0.90550166
0 references
0.9020566
0 references
0.8956618
0 references
0.8956618
0 references
0.87915987
0 references
0.87051183
0 references
0.87051183
0 references
