Maximum subset intersection
From MaRDI portal
Publication:1944892
Recommendations
Cites work
- scientific article; zbMATH DE number 3495588 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1559563 (Why is no real title available?)
- A Greedy Heuristic for the Set-Covering Problem
- A threshold of ln n for approximating set cover
- Algorithmic construction of sets for k -restrictions
- An approximation algorithm for the fault tolerant metric facility location problem
- Approximating min sum set cover
- Approximation algorithms for NP-hard problems.
- Approximation algorithms for partial covering problems
- Linear degree extractors and the inapproximability of max clique and chromatic number
- The budgeted maximum coverage problem
Cited in
(4)
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)