Sciweavers

CC
2006
Springer
123views System Software» more  CC 2006»
13 years 3 months ago
On the complexity of approximating k-set packing
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 with...
Elad Hazan, Shmuel Safra, Oded Schwartz