A note on a maximum k-subset intersection problem

DOI10.1016/J.IPL.2012.03.007MaRDI QIDQ436571zbMATH OpenOpenAlexFDO

Authors Eduardo C. 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

approximation algorithmscombinatorial problemssubset 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)

Recommendations

• An Integer Programming Formulation for the Maximum k-Subset Intersection Problem
• On the inapproximability of maximum intersection problems
• Maximum subset intersection
• scientific article; zbMATH DE number 1176713
• scientific article; zbMATH DE number 1043911

Cites work

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

Cited in

(8)

• Equilibria of plurality voting: lazy and truth-biased voters
• The structure of maximum subsets of \(\{1,\dots,n\}\) with no solutions to \(a+b=kc\)
• On the inapproximability of maximum intersection problems
• Tractable low-delay atomic memory
• Quantile inverse optimization: improving stability in inverse linear programming
• Maximum subset intersection
• An Integer Programming Formulation for the Maximum k-Subset Intersection Problem
• Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436571)