A faster parameterized algorithm for set packing
From MaRDI portal
Publication:1041711
DOI10.1016/j.ipl.2004.12.005zbMath1182.68367OpenAlexW2034011726MaRDI QIDQ1041711
Publication date: 4 December 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2004.12.005
Related Items (14)
Mixing Color Coding-Related Techniques ⋮ Parameterized approximation algorithms for packing problems ⋮ Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets ⋮ Narrow sieves for parameterized paths and packings ⋮ Parameterized complexity of path set packing ⋮ An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem ⋮ Maximum disjoint paths on edge-colored graphs: approximability and tractability ⋮ Algorithm engineering for color-coding with applications to signaling pathway detection ⋮ Faster fixed-parameter tractable algorithms for matching and packing problems ⋮ Improved deterministic algorithms for weighted matching and packing problems ⋮ Kernels for packing and covering problems ⋮ The \(k\)-distinct language: parameterized automata constructions ⋮ An improved kernelization algorithm for \(r\)-set packing ⋮ On counting 3-D matchings of size \(k\)
Cites Work
This page was built for publication: A faster parameterized algorithm for set packing
