Sciweavers

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

92

IWOCA
2009
Springer

112views Algorithms» more IWOCA 2009»

The Guarding Problem - Complexity and Approximation

15 years 7 months ago

The Guarding Problem - Complexity and Approximation

Download www.cse.iitm.ac.in

T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra

Real-time Traffic

IWOCA 2009 |

claim paper

Related Content

» Improved Approximation for Guarding Simple Galleries from the Perimeter

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

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

» An Approximation Scheme for Terrain Guarding

» Locating Guards for Visibility Coverage of Polygons

» Accurate Event Detection for Simulating Hybrid Systems

» Parameterized algorithm for eternal vertex cover

» Domain Independent Ask Approximation in CCP

» AdaptGuard guarding adaptive systems from instability

» On Guard Producing RunTime Checks from Integrity Constraints

Post Info
More Details (n/a)

Added	26 Jul 2010
Updated	26 Jul 2010
Type	Conference
Year	2009
Where	IWOCA
Authors	T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Rangan

Comments (0)