Back to Results
First PageMeta Content
Mathematics / Computational complexity theory / Geometry / Polygons / NP-complete problems / Euclidean plane geometry / Art gallery problem / Computational geometry / Vertex / APX


Maximizing the Guarded Boundary of an Art Gallery is APX-complete Euripides Markou1, Stathis Zachos1,2 and Christodoulos Fragoudakis1 1 Computer Science, ECE, National Technical University of Athens
Add to Reading List

Document Date: 2016-05-24 11:28:43


Open Document

File Size: 158,66 KB

Share Result on Facebook
UPDATE