Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions (Q2343089)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
scientific article

    Statements

    Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 May 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    experimental evaluation
    0 references
    algorithm engineering
    0 references
    Steiner tree
    0 references
    treewidth
    0 references
    dynamic programming
    0 references
    exact algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references