Maximum subset intersection

DOI10.1016/J.IPL.2010.12.003zbMATH Open1260.68463OpenAlexW1996919572MaRDI QIDQ1944892FDOQ1944892

Authors: Raphaël Clifford, Alexandru Popa 

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

Recommendations

• On the inapproximability of maximum intersection problems
• A note on a maximum \(k\)-subset intersection problem
• An Integer Programming Formulation for the Maximum k-Subset Intersection Problem
• On the complexity of approximating \(k\)-set packing
• scientific article; zbMATH DE number 1670858

zbMATH Keywords

approximation algorithmscombinatorial problems

Mathematics Subject Classification ID

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

Cites Work

• A threshold of ln n for approximating set cover
• Title not available (Why is that?)
• A Greedy Heuristic for the Set-Covering Problem
• Approximation algorithms for NP-hard problems.
• Title not available (Why is that?)
• Approximation algorithms for partial covering problems
• Linear degree extractors and the inapproximability of max clique and chromatic number
• The budgeted maximum coverage problem
• Algorithmic construction of sets for k -restrictions
• Title not available (Why is that?)
• Approximating min sum set cover
• An approximation algorithm for the fault tolerant metric facility location problem

Cited In (4)

• Title not available (Why is that?)
• A note on a maximum \(k\)-subset intersection problem
• On the inapproximability of maximum intersection problems
• Equilibria of Plurality Voting: Lazy and Truth-Biased Voters

This page was built for publication: Maximum subset intersection

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