Title of article :
Approximation algorithms for art gallery problems in polygons
Author/Authors :
Subir Kumar Ghosh، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2010
Pages :
5
From page :
718
To page :
722
Keywords :
Greedy algorithms , Approximation algorithms , Computational geometry , Minimum set cover , Visibility polygons , Art gallery problems
Journal title :
Discrete Applied Mathematics
Serial Year :
2010
Journal title :
Discrete Applied Mathematics
Record number :
887385
Link To Document :
بازگشت