Maximum subset intersection

Information Processing Letters

Volumn 111, Issue 7, 2011, Pages 323-325

  Clifford, Raphaël ^a   Popa, Alexandru ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Approximation algorithms; Combinatorial problems

Indexed keywords

COMBINATORIAL PROBLEMS; FOLLOWING PROBLEM; MULTIPLICATIVE FACTORS;

COMBINATORIAL MATHEMATICS;

APPROXIMATION ALGORITHMS;

EID: 78650566209     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2010.12.003     Document Type: Article

References (12)

1. Noga Alon, Dana Moshkovitz, and Shmuel Safra Algorithmic construction of sets for k-restrictions ACM Transactions on Algorithms 2 2 2006 153 177
2. Václav Chvátal A greedy heuristic for the set-covering problem Mathematics of Operations Research 4 3 1979 233 235
3. Uriel Feige A threshold of ln n for approximating set cover Journal of the ACM 45 4 1998 634 652
4. Uriel Feige, László Lovász, and Prasad Tetali Approximating min sum set cover Algorithmica 40 4 2004 219 234
5. Rajiv Gandhi, Samir Khuller, and Aravind Srinivasan Approximation algorithms for partial covering problems Journal of Algorithms 53 1 2004 55 84
6. M.R. Garey, and D.S. Johnson Computers and Intractability. A Guide to the Theory of NP-Completeness 1979 W.H. Freeman
7. Dorit S. Hochbaum Approximation Algorithms for NP-Hard Problems 1997 PWS Publishing Company
8. David S. Johnson, Approximation algorithms for combinatorial problems, in: STOC, 1973, pp. 38-49.
9. Samir Khuller, Anna Moss, and Joseph Naor The budgeted maximum coverage problem Information Processing Letters 70 1 1999 39 45
10. Ran Raz, Shmuel Safra, A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP, in: STOC, 1997, pp. 475-484.
11. Vijay V. Vazirani Approximation Algorithms 2004 Springer
12. David Zuckerman, Linear degree extractors and the inapproximability of max clique and chromatic number, in: STOC, 2006, pp. 681-690.