Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Approximability of unsplittable shortest path routing problems - MaRDI portal

Approximability of unsplittable shortest path routing problems (Q3057101)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Approximability of unsplittable shortest path routing problems
scientific article

    Statements

    title
    Approximability of unsplittable shortest path routing problems (English)
    0 references
    author
    Andreas Bley
    0 references
    published in
    Networks
    0 references
    publication date
    24 November 2010
    0 references
    zbMATH Keywords
    shortest path routing
    0 references
    unsplittable flow
    0 references
    computational complexity
    0 references
    approximation
    0 references
    cites work
    Q4258216
    0 references
    Q4542533
    0 references
    Q2867358
    0 references
    Q4250182
    0 references
    Q4198056
    0 references
    Q5501841
    0 references
    Q4737546
    0 references

    Identifiers

    DOI
    10.1002/net.20303
    0 references
    Mathematics Subject Classification ID
    68Q17
    0 references
    05C85
    0 references
    68W25
    0 references
    90B18
    0 references
    zbMATH DE Number
    5818755
    0 references
    OpenAlex ID
    W4241826368
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3057101&oldid=35201893"
    Powered by MediaWiki