Pages that link to "Item:Q2341691"
From MaRDI portal
The following pages link to Geometric red-blue set cover for unit squares and related problems (Q2341691):
Displaying 11 items.
- A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares (Q902421) (← links)
- \(\mathsf{NP}\)-hardness of geometric set cover and hitting set with rectangles containing a common point (Q1621499) (← links)
- Approximability and hardness of geometric hitting set with axis-parallel rectangles (Q1621500) (← links)
- Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover} (Q1679222) (← links)
- Algorithms and complexity for a class of combinatorial optimization problems with labelling (Q2031932) (← links)
- Approximation algorithm for minimum partial multi-cover under a geometric setting (Q2115321) (← links)
- Weighted geometric set cover with rectangles of bounded integer side lengths (Q2133398) (← links)
- Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
- On the geometric red-blue set cover problem (Q2232240) (← links)
- Dynamic Minimum Bichromatic Separating Circle (Q3467880) (← links)
- On Partial Covering For Geometric Set Systems (Q5115815) (← links)
