On the structure of parameterized problems in NP
Information and Computation
On fixed-parameter tractability and approximability of NP optimization problems
Journal of Computer and System Sciences - special issue on complexity theory
An improved fixed-parameter algorithm for vertex cover
Information Processing Letters
Vertex cover: further observations and further improvements
Journal of Algorithms
Concrete Mathematics: A Foundation for Computer Science
Concrete Mathematics: A Foundation for Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Graph Theory With Applications
Graph Theory With Applications
A faster parameterized algorithm for set packing
Information Processing Letters
Improved algorithms for path, matching, and packing problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A Parameterized Perspective on Packing Paths of Length Two
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
A Quadratic Kernel for 3-Set Packing
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Improved Deterministic Algorithms for Weighted Matching and Packing Problems
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
A faster parameterized algorithm for set packing
Information Processing Letters
Parameterized algorithms for weighted matching and packing problems
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
An O*(3.523k) parameterized algorithm for 3-set packing
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
An improved kernelization algorithm for r-Set Packing
Information Processing Letters
A dynamic programming algorithm for tree-like weighted set packing problem
Information Sciences: an International Journal
An O*(3.533k)-time parameterized algorithm for the 3-set packing problem
Theoretical Computer Science
Improved deterministic algorithms for weighted matching and packing problems
Theoretical Computer Science
Exact parameterized multilinear monomial counting via k-layer subset convolution and k-disjoint
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching
ACM Transactions on Algorithms (TALG)
On the parameterized complexity of exact satisfiability problems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Fixed-Parameter algorithms for cochromatic number and disjoint rectangle stabbing
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Finding k disjoint triangles in an arbitrary graph
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Greedy localization and color-coding: improved matching and packing algorithms
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Towards a taxonomy of techniques for designing parameterized algorithms
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Parameterized algorithms for weighted matching and packing problems
Discrete Optimization
A New Local Search Algorithm for Binary Optimization
INFORMS Journal on Computing
Information and Computation
| Hi-index | 0.00 |
We present an efficient parameterized algorithm solving the Set Packing problem, in which we assume that the size of the sets is bounded by m. In particular, if the size m of the sets is bounded by a constant, then our algorithm is fixed-parameter tractable. For example, if the size of the sets is bounded by 3, then our algorithm runs in time O((5.7k)kn).