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 20 items.
- Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102) (← links)
- Angle covers: algorithms and complexity (Q782165) (← links)
- NP-harte Probleme für minimale Polygonüberdeckungen. (NP-hard problems for minimal polygon coverings) (Q811138) (← 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)
- Covering a simplex by spheres: complexity and algorithms (Q2162517) (← links)
- Drawing borders efficiently (Q2272197) (← links)
- Approximation algorithms for decomposing octilinear polygons (Q2420578) (← links)
- The Boolean Basis Problem and How to Cover Some Polygons by Rectangles (Q3031946) (← links)
- (Q3507774) (← links)
- Stabbing Convex Polygons with a Segment or a Polygon (Q3541074) (← links)
- Approximation schemes for covering and packing problems in image processing and VLSI (Q3771608) (← links)
- (Q3980378) (← links)
- Covering Polygons Is Hard (Q4304059) (← links)
- New heuristic algorithms for the rectangular $p$-cover problem (Q4837962) (← links)
- (Q4929402) (← links)
- Experimental and Efficient Algorithms (Q5710072) (← links)
- Parameterized complexity of geometric covering problems having conflicts (Q5919304) (← links)
- A hybrid heuristic for the rectilinear picture compression problem (Q6097853) (← links)