Improved approximation algorithms for computing \(k\) disjoint paths subject to two constraints (Q2354302)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Improved approximation algorithms for computing \(k\) disjoint paths subject to two constraints
scientific article

    Statements

    Improved approximation algorithms for computing \(k\) disjoint paths subject to two constraints (English)
    0 references
    0 references
    0 references
    0 references
    10 July 2015
    0 references
    \(k\)-disjoint bi-constraint path
    0 references
    NP-hard
    0 references
    bifactor approximation algorithm
    0 references
    auxiliary graph
    0 references
    cycle cancellation
    0 references

    Identifiers

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