Original Paper

computational complexity

, Volume 15, Issue 1, pp 20-39

First online:

On the complexity of approximating k-set packing

  • Elad HazanAffiliated withComputer Science Department, Princeton University
  • , Shmuel SafraAffiliated withSchool of Computer Science, Tel Aviv University
  • , Oded SchwartzAffiliated withSchool of Computer Science, Tel Aviv University

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


Given a k-uniform hypergraph, the Maximum k -Set Packing problem is to find the maximum disjoint set of edges. We prove that this problem cannot be efficiently approximated to within a factor of \( \Omega {\left( {k/\ln k} \right)} \) unless P = NP. This improves the previous hardness of approximation factor of \( k/2^{{O({\sqrt {\ln k} })}} \) by Trevisan. This result extends to the problem of k-Dimensional-Matching.


Computational complexity hardness of approximation set packing

Subject classification.