On the complexity and algorithm of grooming regular traffic in WDM optical networks (Q436806)

From MaRDI portal
Revision as of 12:38, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity and algorithm of grooming regular traffic in WDM optical networks
scientific article

    Statements

    On the complexity and algorithm of grooming regular traffic in WDM optical networks (English)
    0 references
    0 references
    0 references
    26 July 2012
    0 references
    traffic grooming
    0 references
    SONET/WDM networks
    0 references
    graph partition
    0 references
    NP-completeness
    0 references
    approximation algorithm
    0 references

    Identifiers