A note on a Maximum k-Subset Intersection problem

Information Processing Letters

Volumn 112, Issue 12, 2012, Pages 471-472

  Xavier, Eduardo C ^a  

^a UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Approximation algorithms; Combinatorial problems; Subset intersection

Indexed keywords

CLIFFORD; COMBINATORIAL PROBLEM; FINITE SET; FOLLOWING PROBLEM; INTERSECTION PROBLEM; OPEN PROBLEMS; POSITIVE INTEGERS;

APPROXIMATION ALGORITHMS;

SET THEORY;

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

References (5)

1. Christoph Ambühl, Monaldo Mastrolilli, and Ola Svensson Inapproximability results for maximum edge biclique, minimum linear arrangement, and sparsest cut SIAM J. Comput. 40 2 2011 567 596
2. Raphaël Clifford, and Alexandru Popa Maximum subset intersection Inform. Process. Lett. 111 7 2011 323 325
3. Santo Fortunato Community detection in graphs Phys. Rep. 486 3-5 2010 75 174
4. Sushmita Mitra, and Haider Banka Multi-objective evolutionary biclustering of gene expression data Pattern Recognit. 39 12 2006 2464 2477 (Pubitemid 44344744)
5. René Peeters The maximum edge biclique problem is np-complete Discrete Appl. Math. 131 3 2003 651 654