Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems (Q1949736)

From MaRDI portal
Revision as of 11:17, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
scientific article

    Statements

    Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems (English)
    0 references
    0 references
    0 references
    16 May 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    inclusion-exclusion
    0 references
    fixed parameter tractability
    0 references
    exact algorithms
    0 references
    polynomial space
    0 references
    Steiner tree
    0 references
    0 references