An improved algorithm for weighted 3-set packing

DOI10.3724/SP.J.1001.2010.03524MaRDI QIDQ3071458zbMATH OpenOpenAlexFDO

Authors Qilong Feng, Jianxin Wang, Jianer Chen

Publication date 5 February 2011

Published in Journal of Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/sp.j.1001.2010.03524

zbMATH Keywords

color-codingweighted 3-set packingweighted 3-set packing augmentation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• Improved Parameterized Algorithms for Weighted 3-Set Packing
• An O *(3.523k ) Parameterized Algorithm for 3-Set Packing
• An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem
• Improved deterministic algorithms for weighted matching and packing problems
• Improved Deterministic Algorithms for Weighted Matching and Packing Problems

Cited in

(5)

• A dynamic programming algorithm for tree-like weighted set packing problem
• An O *(3.523k ) Parameterized Algorithm for 3-Set Packing
• Improved Parameterized Algorithms for Weighted 3-Set Packing
• A Quadratic Kernel for 3-Set Packing
• Solving the set packing problem via a maximum weighted independent set heuristic

This page was built for publication: An improved algorithm for weighted 3-set packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3071458)