Close approximations of minimum rectangular coverings (extended abstract)

DOI10.1007/3-540-62034-6_44MaRDI QIDQ6567763zbMATH OpenFDO

Authors Christos Levcopoulos, Joachim Gudmundsson

Publication date 5 July 2024

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Close approximations of minimum rectangular coverings
• scientific article; zbMATH DE number 4049039
• scientific article; zbMATH DE number 3872705
• scientific article; zbMATH DE number 3893101
• scientific article; zbMATH DE number 3918386

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3918386 (Why is no real title available?)
• scientific article; zbMATH DE number 4049039 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• Covering Polygons Is Hard
• Some NP-hard polygon decomposition problems

This page was built for publication: Close approximations of minimum rectangular coverings (extended abstract)

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