Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
The budgeted maximum coverage problem
Information Processing Letters
Approximation algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation algorithms for combinatorial problems
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Approximating Min Sum Set Cover
Algorithmica
Approximation algorithms for partial covering problems
Journal of Algorithms
Linear degree extractors and the inapproximability of max clique and chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Algorithmic construction of sets for k-restrictions
ACM Transactions on Algorithms (TALG)
A note on a Maximum k-Subset Intersection problem
Information Processing Letters
On the inapproximability of maximum intersection problems
Information Processing Letters
A system for behavior prediction based on neural signals
Neurocomputing
| Hi-index | 0.89 |
Consider the following problem. Given u sets of sets A"1,...,A"u with elements over a universe E={e"1,...,e"n}, the goal is to select exactly one set from each of A"1,...,A"u in order to maximize the size of the intersection of the sets. In this paper we present a gap-preserving reduction from Max-Clique which enables us to show that our problem cannot be approximated within an n^1^-^@e multiplicative factor, for any @e0, unless P=NP (Zuckerman, 2006 [12]).