On the Complexity of the Traffic Grooming Problem in Optical Networks (Q5426031): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-72914-3_23 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1564787786 / rank | |||
Normal rank | |||
Latest revision as of 22:47, 19 March 2024
scientific article; zbMATH DE number 5212157
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of the Traffic Grooming Problem in Optical Networks |
scientific article; zbMATH DE number 5212157 |
Statements
On the Complexity of the Traffic Grooming Problem in Optical Networks (English)
0 references
15 November 2007
0 references
wavelength assignment
0 references
wavelength division multiplexing (WDM)
0 references
optical networks
0 references
add-drop multiplexer (ADM)
0 references
