Logarithmic hardness of the directed congestion minimization problem (Q2931414)

From MaRDI portal
Revision as of 23:20, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(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

    title
    Logarithmic hardness of the directed congestion minimization problem (English)
    0 references
    author
    Lisa Zhang
    0 references
    Matthew T. Andrews
    0 references
    publication date
    25 November 2014
    0 references
    zbMATH Keywords
    congestion minimization
    0 references
    directed graphs
    0 references
    hardness of approximation
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q17
    0 references
    05C85
    0 references
    68W25
    0 references
    90C35
    0 references
    90C59
    0 references
    zbMATH DE Number
    6373924
    0 references
    OpenAlex ID
    W2125725829
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2931414&oldid=32154303"
    Powered by MediaWiki