Pages that link to "Item:Q5959557"
From MaRDI portal
The following pages link to Inapproximability of finding maximum hidden sets on polygons and terrains (Q5959557):
Displaying 6 items.
- FO model checking on geometric graphs (Q1631773) (← links)
- Computing the maximum clique in the visibility graph of a simple polygon (Q2466015) (← links)
- Finding minimum hidden guard sets in polygons --- tight approximability results (Q2489014) (← links)
- Gender-aware facility location in multi-gender world (Q3301019) (← links)
- (Q5111878) (← links)
- Online class cover problem (Q6600810) (← links)