Polynomial flow-cut gaps and hardness of directed cut problems (Q3452200)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Polynomial flow-cut gaps and hardness of directed cut problems
scientific article

    Statements

    Polynomial flow-cut gaps and hardness of directed cut problems (English)
    0 references
    0 references
    0 references
    11 November 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    directed multicut
    0 references
    hardness of approximation
    0 references
    sparsest cut
    0 references
    0 references