A dynamic programming algorithm for tree-like weighted set packing problem (Q2638196): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Faster fixed-parameter tractable algorithms for matching and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms and applications for tree-like Weighted Set Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Local Improvement and Weighted Set Packing Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient parameterized algorithm for m-set packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility Among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Weighted Matching and Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies / rank
 
Normal rank

Latest revision as of 05:43, 3 July 2024

scientific article
Language Label Description Also known as
English
A dynamic programming algorithm for tree-like weighted set packing problem
scientific article

    Statements

    A dynamic programming algorithm for tree-like weighted set packing problem (English)
    0 references
    0 references
    0 references
    15 September 2010
    0 references
    0 references
    assignment problem
    0 references
    dynamic programming
    0 references
    set packing problem
    0 references
    tree-like structure
    0 references
    complexity of algorithm
    0 references
    0 references