Logarithmic hardness of the directed congestion minimization problem (Q2931414)

From MaRDI portal
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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    congestion minimization
    0 references
    directed graphs
    0 references
    hardness of approximation
    0 references
    0 references