Pages that link to "Item:Q1621499"
From MaRDI portal
The following pages link to \(\mathsf{NP}\)-hardness of geometric set cover and hitting set with rectangles containing a common point (Q1621499):
Displaying 7 items.
- Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions (Q335346) (← links)
- Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102) (← links)
- An approximation algorithm for submodular hitting set problem with linear penalties (Q830939) (← links)
- Approximability and hardness of geometric hitting set with axis-parallel rectangles (Q1621500) (← links)
- Weighted geometric set cover with rectangles of bounded integer side lengths (Q2133398) (← links)
- On the geometric red-blue set cover problem (Q2232240) (← links)
- Geometric Set Cover and Hitting Sets for Polytopes in R (Q4910744) (← links)
