A note on a maximum \(k\)-subset intersection problem

DOI10.1016/j.ipl.2012.03.007zbMath1243.68189OpenAlexW2073146327MaRDI QIDQ436571

Eduardo Candido Xavier

Publication date: 25 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.03.007

zbMATH Keywords

combinatorial problemsapproximation algorithmssubset intersection

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (6)

Equilibria of Plurality Voting: Lazy and Truth-Biased Voters ⋮ An Integer Programming Formulation for the Maximum k-Subset Intersection Problem ⋮ Tractable low-delay atomic memory ⋮ Quantile Inverse Optimization: Improving Stability in Inverse Linear Programming ⋮ On the inapproximability of maximum intersection problems ⋮ Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks

Cites Work

• Multi-objective evolutionary biclustering of gene expression data
• The maximum edge biclique problem is NP-complete
• Maximum subset intersection
• Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut

This page was built for publication: A note on a maximum \(k\)-subset intersection problem