Red blue set cover problem on axis-parallel hyperplanes and other objects
From MaRDI portal
Recommendations
Cites work
- A constant-factor approximation algorithm for red-blue set cover with unit disks
- An efficient fixed-parameter algorithm for 3-hitting set
- An improved algorithm for the red-blue hitting set problem with the consecutive ones property
- Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems
- Geometric red-blue set cover for unit squares and related problems
- scientific article; zbMATH DE number 1445322 (Why is no real title available?)
- Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover}
- On the geometric red-blue set cover problem
- On the positive-negative partial set cover problem
- Parameterized algorithms
- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
- Red-blue covering problems and the consecutive ones property
Cited in
(5)
This page was built for publication: Red blue set cover problem on axis-parallel hyperplanes and other objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551707)