On the complexity of the regenerator cost problem in general networks with traffic grooming (Q528858)
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 the regenerator cost problem in general networks with traffic grooming |
scientific article; zbMATH DE number 6718309
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the regenerator cost problem in general networks with traffic grooming |
scientific article; zbMATH DE number 6718309 |
Statements
On the complexity of the regenerator cost problem in general networks with traffic grooming (English)
0 references
17 May 2017
0 references
optical networks
0 references
wavelength division multiplexing (WDM)
0 references
regenerators
0 references
traffic grooming
0 references
approximation algorithms
0 references
complexity
0 references
0.8741579
0 references
0.8640834
0 references
0.8640834
0 references
0.8629847
0 references
0.86060774
0 references
0.8600683
0 references
0.8429773
0 references
0 references
