Pages that link to "Item:Q1200939"
From MaRDI portal
The following pages link to Further NP-hard problems for minimal polygon coverings (Q1200939):
Displaying 5 items.
- NP-harte Probleme für minimale Polygonüberdeckungen. (NP-hard problems for minimal polygon coverings) (Q811138) (← links)
- Minimum constellation covers: hardness, approximability and polynomial cases (Q2025056) (← links)
- Covering oriented points in the plane with orthogonal polygons is NP-complete (Q2883577) (← links)
- Covering Polygons Is Hard (Q4304059) (← links)
- (Q4929402) (← links)