Minimum-cost dynamic flows: The series-parallel case (Q4474291)

From MaRDI portal
Revision as of 17:25, 29 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2081223
Language Label Description Also known as
English
Minimum-cost dynamic flows: The series-parallel case
scientific article; zbMATH DE number 2081223

    Statements

    Minimum-cost dynamic flows: The series-parallel case (English)
    0 references
    0 references
    0 references
    0 references
    4 August 2004
    0 references
    minimum-cost flow
    0 references
    dynamic network flow
    0 references
    greedy algorithm
    0 references
    two-terminal series parallel networks
    0 references

    Identifiers