A dynamic programming algorithm for tree-like weighted set packing problem

DOI10.1016/j.ins.2010.06.035zbMath1195.90076OpenAlexW1980428206MaRDI QIDQ2638196

Mehmet Gulek, Ismail Hakki Toroslu

Publication date: 15 September 2010

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2010.06.035

zbMATH Keywords

dynamic programmingassignment problemset packing problemcomplexity of algorithmtree-like structure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Related Items

An evolutionary algorithm based hyper-heuristic framework for the set packing problem ⋮ Task assignment in tree-like hierarchical structures ⋮ CSD-coded genetic algorithm on robustly stable multiplierless IIR filter design

Cites Work

• Unnamed Item
• Exact algorithms and applications for tree-like Weighted Set Cover
• Faster fixed-parameter tractable algorithms for matching and packing problems
• Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies
• Greedy Local Improvement and Weighted Set Packing Approximation
• Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms
• Reducibility Among Combinatorial Problems
• An efficient parameterized algorithm for m-set packing
• Parameterized Algorithms for Weighted Matching and Packing Problems