Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

25

DAM
2010

favoriteEmaildiscussreport

159views more DAM 2010»

Approximation algorithms for art gallery problems in polygons

13 years 8 months ago

Approximation algorithms for art gallery problems in polygons

Download math.cts.ntu.edu.tw

Subir Kumar Ghosh

Real-time Traffic

DAM 2010 | Distributed And Parallel Computing |

claim paper

Related Content

» Approximation Algorithms for Art Gallery Problems in Polygons and Terrains

» Maximizing the Guarded Boundary of an Art Gallery Is APXComplete

» A Pseudopolynomial Time O log n Approximation Algorithm for Art Gallery Problems

» Guarding curvilinear art galleries with edge or mobile guards

» Improved Approximation for Guarding Simple Galleries from the Perimeter

» New Results on Visibility in Simple Polygons

» Wireless Localization with Vertex Guards is NPhard

» Guarding galleries and terrains

» Locating Guards for Visibility Coverage of Polygons

Post Info
More Details (n/a)

Added	01 Mar 2011
Updated	01 Mar 2011
Type	Journal
Year	2010
Where	DAM
Authors	Subir Kumar Ghosh

Comments (0)