Sciweavers

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

36

WALCOM
2010
IEEE

favoriteEmaildiscussreport

320views Algorithms» more WALCOM 2010»

Approximation Algorithms for Art Gallery Problems in Polygons and Terrains

14 years 5 months ago

Approximation Algorithms for Art Gallery Problems in Polygons and Terrains

Download www.tcs.tifr.res.in

Subir Kumar Ghosh

Real-time Traffic

Algorithms | WALCOM 2010 |

claim paper

Related Content

» Approximation algorithms for art gallery problems in polygons

» Guarding galleries 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

» A system to place observers on a polyhedral terrain in polynomial time

» Improved Approximation for Guarding Simple Galleries from the Perimeter

» Approximation Algorithms to Minimum Vertex Cover Problems on Polygons and Terrains

» Locating Guards for Visibility Coverage of Polygons

Post Info
More Details (n/a)

Added	15 May 2010
Updated	15 May 2010
Type	Conference
Year	2010
Where	WALCOM
Authors	Subir Kumar Ghosh

Comments (0)