A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem (Q4376743)

From MaRDI portal
Revision as of 15:35, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article; zbMATH DE number 1117848
Language Label Description Also known as
English
A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem
scientific article; zbMATH DE number 1117848

    Statements

    A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem (English)
    0 references
    0 references
    0 references
    26 November 1998
    0 references
    tree knapsack problem
    0 references
    pseudopolynomial-time algorithm
    0 references

    Identifiers