Unsplittable Anycast Flow Problem: Formulation and Algorithms (Q3545051)

From MaRDI portal
Revision as of 20:46, 28 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q1424780)
scientific article
Language Label Description Also known as
English
Unsplittable Anycast Flow Problem: Formulation and Algorithms
scientific article

    Statements

    title
    Unsplittable Anycast Flow Problem: Formulation and Algorithms (English)
    0 references
    DOI
    10.1007/11758501_83
    0 references
    publication date
    9 December 2008
    0 references
    zbMATH DE Number
    5379690
    0 references
    zbMATH Keywords
    UFP
    0 references
    connection-oriented network
    0 references
    anycast
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3545051&oldid=23481750"
    Powered by MediaWiki