Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties (Q2082211): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-020-00568-2 / rank
Normal rank
 
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual approximation algorithm for the facility location problem with submodular penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual approximation algorithms for integral flow and multicut in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Function Minimization under Covering Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the submodular vertex cover problem with submodular penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved parameterized and exact algorithms for cut problems on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial multicuts in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for the facility location problems with linear/submodular penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalized multiway cut in trees problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the generalized \(k\)-multicut problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-020-00568-2 / rank
 
Normal rank

Latest revision as of 00:06, 17 December 2024

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