A strongly polynomial time algorithm for the maximum supply rate problem on trees (Q5919326)

From MaRDI portal
Revision as of 19:51, 17 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7152262
Language Label Description Also known as
English
A strongly polynomial time algorithm for the maximum supply rate problem on trees
scientific article; zbMATH DE number 7152262

    Statements

    A strongly polynomial time algorithm for the maximum supply rate problem on trees (English)
    0 references
    0 references
    0 references
    16 January 2020
    0 references
    strongly polynomial-time algorithm
    0 references
    dynamic programming
    0 references
    maximum supply rate problem
    0 references

    Identifiers

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