scientific article; zbMATH DE number 2011842

MaRDI QIDQ4437494zbMATH OpenFDO

Authors Euripides Markou, Stathis Zachos, Christodoulos Fragoudakis

Publication date 2 December 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2653/26530024.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Maximizing the guarded boundary of an Art Gallery is APX-complete
• An exact algorithm for minimizing vertex guards on art galleries
• scientific article; zbMATH DE number 219237
• Exact solutions and bounds for general art gallery problems
• Exact Solutions and Bounds for General Art Gallery Problems
• Approximation algorithms for art gallery problems in polygons
• An approximation algorithm for the art gallery problem
• A nearly optimal algorithm for covering the interior of an art gallery
• scientific article; zbMATH DE number 139794
• scientific article; zbMATH DE number 177851

Cited in

(3)

• Maximizing the guarded boundary of an Art Gallery is APX-complete
• scientific article; zbMATH DE number 219237 (Why is no real title available?)
• Stathis Zachos at 70!

This page was built for publication:

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