A faster parameterized algorithm for set packing
From MaRDI portal
Publication:1041711
DOI10.1016/j.ipl.2004.12.005zbMath1182.68367MaRDI 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
68W05: Nonnumerical algorithms
Related Items
The \(k\)-distinct language: parameterized automata constructions, Parameterized approximation algorithms for packing problems, Improved deterministic algorithms for weighted matching and packing problems, An improved kernelization algorithm for \(r\)-set packing, Algorithm engineering for color-coding with applications to signaling pathway detection, Faster fixed-parameter tractable algorithms for matching and packing problems, On counting 3-D matchings of size \(k\), Maximum disjoint paths on edge-colored graphs: approximability and tractability, Kernels for packing and covering problems, Narrow sieves for parameterized paths and packings, An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem, Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets, Mixing Color Coding-Related Techniques
Cites Work
