Lower bounds for two-period grooming via linear programming duality (Q3548731)

From MaRDI portal
Revision as of 12:46, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Lower bounds for two-period grooming via linear programming duality
scientific article

    Statements

    title
    Lower bounds for two-period grooming via linear programming duality (English)
    0 references
    DOI
    10.1002/net.20251
    0 references
    author
    Charles J. Colbourn
    0 references
    Gaetano Quattrocchi
    0 references
    Violet R. Syrotiuk
    0 references
    published in
    Networks
    0 references
    publication date
    17 December 2008
    0 references
    Mathematics Subject Classification ID
    90B15
    0 references
    90C05
    0 references
    90C10
    0 references
    zbMATH DE Number
    5383025
    0 references
    zbMATH Keywords
    optical networks
    0 references
    traffic grooming
    0 references
    graph decomposition
    0 references
    combinatorial designs
    0 references
    linear programming duality
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3548731&oldid=27872658"
    Powered by MediaWiki