Complexities of efficient solutions of rectilinear polygon cover problems
From MaRDI portal
Publication:676264
DOI10.1007/BF02523677zbMath0869.68058MaRDI QIDQ676264
Publication date: 16 March 1997
Published in: Algorithmica (Search for Journal in Brave)
Related Items (7)
The 2D subarray polytope ⋮ Exact algorithms and APX-hardness results for geometric packing and covering problems ⋮ A hybrid heuristic for the rectilinear picture compression problem ⋮ Stabbing Convex Polygons with a Segment or a Polygon ⋮ Drawing borders efficiently ⋮ The maximum 2D subarray polytope: facet-inducing inequalities and polyhedral computations ⋮ Lower bounds for approximate polygon decomposition and minimum gap
Cites Work
- On the complexity of approximating the independent set problem
- Optimization, approximation, and complexity classes
- An algorithm for covering polygons with rectangles
- Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles
- Perfect Graphs and Orthogonally Convex Covers
- Some NP-hard polygon decomposition problems
- Covering Polygons Is Hard
- Covering Regions by Rectangles
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Complexities of efficient solutions of rectilinear polygon cover problems
