Close approximations of minimum rectangular coverings

DOI10.1023/A:1009879504783MaRDI QIDQ1970337zbMATH OpenOpenAlexFDO

Authors Christos Levcopoulos, Joachim Gudmundsson

Publication date 4 September 2000

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1009879504783

zbMATH Keywords

computational geometryapproximation algorithmscovering polygons

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 4049039
• scientific article; zbMATH DE number 3872705
• scientific article; zbMATH DE number 3893101
• A linear-time heuristic for minimum rectangular coverings (Extended abstract)
• scientific article; zbMATH DE number 3918386

Cited in

(27)

• An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee
• Approximation schemes for covering and packing problems in image processing and VLSI
• scientific article; zbMATH DE number 1877049 (Why is no real title available?)
• scientific article; zbMATH DE number 3893101 (Why is no real title available?)
• Close approximations of minimum rectangular coverings (extended abstract)
• Covering polygons with rectangles
• Covering Rectilinear Polygons with Axis-Parallel Rectangles
• scientific article; zbMATH DE number 3872705 (Why is no real title available?)
• OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS
• Smallest \(k\)-enclosing rectangle revisited
• scientific article; zbMATH DE number 2080277 (Why is no real title available?)
• A linear-time heuristic for minimum rectangular coverings (Extended abstract)
• scientific article; zbMATH DE number 776079 (Why is no real title available?)
• Drawing borders efficiently
• scientific article; zbMATH DE number 5369649 (Why is no real title available?)
• An algorithm for covering polygons with rectangles
• A translational rectangular covering
• Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles
• scientific article; zbMATH DE number 3918386 (Why is no real title available?)
• scientific article; zbMATH DE number 3967928 (Why is no real title available?)
• scientific article; zbMATH DE number 3888915 (Why is no real title available?)
• scientific article; zbMATH DE number 4049039 (Why is no real title available?)
• scientific article; zbMATH DE number 4098747 (Why is no real title available?)
• Fast approximation algorithms for a nonconvex covering problem
• Covering rectilinear polygons with axis-parallel rectangles
• Experimental and Efficient Algorithms
• Beyond triangulation: covering polygons with triangles

This page was built for publication: Close approximations of minimum rectangular coverings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1970337)