Maximum subset intersection

DOI10.1016/j.ipl.2010.12.003zbMath1260.68463OpenAlexW1996919572MaRDI QIDQ1944892

Alexandru Popa, Raphaël Clifford

Publication date: 28 March 2013

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

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

zbMATH Keywords

combinatorial problemsapproximation algorithms

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Approximation algorithms (68W25)

Related Items

Equilibria of Plurality Voting: Lazy and Truth-Biased Voters ⋮ A note on a maximum \(k\)-subset intersection problem ⋮ On the inapproximability of maximum intersection problems

Cites Work

• The budgeted maximum coverage problem
• An approximation algorithm for the fault tolerant metric facility location problem
• Approximating min sum set cover
• Linear degree extractors and the inapproximability of max clique and chromatic number
• Algorithmic construction of sets for k -restrictions
• A threshold of ln n for approximating set cover
• A Greedy Heuristic for the Set-Covering Problem
• Approximation algorithms for partial covering problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item