Logarithmic hardness of the directed congestion minimization problem (Q2931414)

From MaRDI portal
Revision as of 17:05, 23 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Logarithmic hardness of the directed congestion minimization problem
scientific article

    Statements

    Logarithmic hardness of the directed congestion minimization problem (English)
    0 references
    0 references
    0 references
    25 November 2014
    0 references
    congestion minimization
    0 references
    directed graphs
    0 references
    hardness of approximation
    0 references

    Identifiers

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