Pages that link to "Item:Q676264"
From MaRDI portal
The following pages link to Complexities of efficient solutions of rectilinear polygon cover problems (Q676264):
Displaying 7 items.
- Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102) (← links)
- Lower bounds for approximate polygon decomposition and minimum gap (Q1603513) (← links)
- The maximum 2D subarray polytope: facet-inducing inequalities and polyhedral computations (Q2091811) (← links)
- The 2D subarray polytope (Q2132390) (← links)
- Drawing borders efficiently (Q2272197) (← links)
- Stabbing Convex Polygons with a Segment or a Polygon (Q3541074) (← links)
- A hybrid heuristic for the rectilinear picture compression problem (Q6097853) (← links)
