Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties (Q2082211)

From MaRDI portal
Revision as of 00:06, 17 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties
scientific article

    Statements

    Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties (English)
    0 references
    0 references
    0 references
    4 October 2022
    0 references
    multicut
    0 references
    approximation algorithm
    0 references
    submodular penalties
    0 references
    primal-dual
    0 references

    Identifiers