On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem (Q3596341): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 11:57, 5 March 2024

scientific article
Language Label Description Also known as
English
On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem
scientific article

    Statements

    On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem (English)
    0 references
    0 references
    30 August 2007
    0 references
    Shortest Path Routing
    0 references
    Unsplittable Flow
    0 references
    Computational Complexity
    0 references
    Approximation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references