Maximizing the margin between desirable and undesirable elements in a covering problem
From MaRDI portal
Cites work
- Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems
- Correlation clustering
- Geometric red-blue set cover for unit squares and related problems
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256762 (Why is no real title available?)
- scientific article; zbMATH DE number 1445322 (Why is no real title available?)
- Improved performance of the greedy algorithm for partial cover
- Inapproximability results for bounded variants of optimization problems.
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- On approximating partial scenario set cover
- On the complexity of approximating \(k\)-dimensional matching
- On the geometric red-blue set cover problem
- On the positive-negative partial set cover problem
- Red blue set cover problem on axis-parallel hyperplanes and other objects
- Reducibility among combinatorial problems
- Some simplified NP-complete graph problems
- The densest k-subhypergraph problem
This page was built for publication: Maximizing the margin between desirable and undesirable elements in a covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7442692)