A faster parameterized algorithm for set packing

  • Authors:

  • Ioannis Koutis

  • Affiliations:

  • Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213, USA

  • Venue:
  • Information Processing Letters
  • Year:
  • 2005

Quantified Score

Hi-index 0.89

Visualization

Abstract

We present an efficient parameterized algorithm for the (k,t)-set packing problem, in which we are looking for a collection of k disjoint sets whose union consists of t elements. The complexity of the algorithm is O(2^O^(^t^)nNlogN). For the special case of sets of bounded size, this improves the O((ck)^kn) algorithm of Jia et al. [J. Algorithms 50 (1) (2004) 106].