An efficient parameterized algorithm for m-set packing

@article{Jia2004AnEP,
  title={An efficient parameterized algorithm for m-set packing},
  author={Weijia Jia and Chuanlin Zhang and Jianer Chen},
  journal={J. Algorithms},
  year={2004},
  volume={50},
  pages={106-117}
}
We present an efficient parameterized algorithm solving the Set Packing problem, in wh assume that the size of the sets is bounded by m. In particular, if the sizem of the sets is bounde by a constant, then our algorithm is fixed-parameter tractable. For example, if the size of the bounded by 3, then our algorithm runs in time O((5.7k)kn).  2003 Elsevier Inc. All rights reserved. 
BETA

From This Paper

Topics from this paper.

Similar Papers

Loading similar papers…