Approximating the traffic grooming problem (Q1018099): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jda.2007.09.001 / rank | |||
| Property / cites work | |||
| Property / cites work: Structural Information and Communication Complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The SONET edge‐partition problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4946041 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Complexity of the Traffic Grooming Problem in Optical Networks / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JDA.2007.09.001 / rank | |||
Normal rank | |||
Latest revision as of 13:08, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the traffic grooming problem |
scientific article |
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
