New Hardness Results for Routing on Disjoint Paths (Q3387753)

From MaRDI portal
scientific article
Language Label Description Also known as
English
New Hardness Results for Routing on Disjoint Paths
scientific article

    Statements

    New Hardness Results for Routing on Disjoint Paths (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 January 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    hardness of approximation
    0 references
    disjoint paths
    0 references
    graph routing problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references