On the inapproximability of maximum intersection problems

Information Processing Letters

Volumn 112, Issue 19, 2012, Pages 723-727

  Shieh, Min Zheng ^a   Tsai, Shi Chun ^a   Yang, Ming Chuan ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Approximation algorithm; Disclosure control; Inapproximability; Maximum intersection; Theory of computation

Indexed keywords

ABSOLUTE ERROR; CARDINALITIES; CLIFFORD; DISCLOSURE CONTROL; INAPPROXIMABILITY; MAX-CLIQUE PROBLEM; MAXIMUM INTERSECTION; THEORY OF COMPUTATION;

APPROXIMATION ALGORITHMS;

COMPUTATION THEORY;

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

References (18)

1. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties second corrected ed. 2003 Springer-Verlag Berlin/Heidelberg
2. P. Bonizzoni, G.D. Vedova, and R. Dondi Anonymizing binary and small tables is hard to approximate Journal of Combinatorial Optimization 22 1 2011 97 119
3. R. Clifford, and A. Popa Maximum subset intersection Information Processing Letters 111 2011 323 325
4. U. Feige, L. Lovász, and P. Tetali Approximating min sum set cover Algorithmica 40 4 2004 219 234
5. R. Gandhi, S. Khuller, and A. 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. O. Goldreich On promise problems (a survey in memory of Shimon Even) Electronic Colloquium on Computational Complexity (ECCC) 2005 TR05 TR018
8. - ε Acta Mathematica 182 1999 105 142
9. J. Håstad Some optimal inapproximability results Journal of the ACM 48 2001 798 859
10. S. Khuller, A. Moss, and J. Naor The budgeted maximum coverage problem Information Processing Letters 70 1 1999 39 45
11. A. Meyerson, R. Williams, On the complexity of optimal K-anonymity, in: Proceedings of the Twenty-Third ACM Symposium on Principles of Database Systems (PODS), Paris, France, 2004.
12. R. Peeters The maximum edge biclique problem is NP-complete Discrete Applied Mathematics 131 2003 651 654
13. J.H. van Lint, and R.M. Wilson A Course in Combinatorics second ed. 2001 Cambridge University Press
14. V.V. Vazirani Approximation Algorithms 2003 Springer-Verlag Berlin/Heidelberg
15. S.A. Vinterbo, Maximum k-intersection, edge labeled multigraph max capacity k-path, and max factor k-GCD are all NP-hard, Decision Systems Group, Harvard Medical School, Technical Report, 2002.
16. S.A. Vinterbo Privacy: A machine learning view IEEE Transactions on Knowledge and Data Engineering 16 8 2004 939 948
17. E.C. Xavier A note on a maximum k-subset intersection problem Information Processing Letters 112 2012 471 472
18. D. Zuckerman Linear degree extractors and the inapproximability of max clique and chromatic number Theory of Computing 3 2007 103 128