Sciweavers

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

86

SODA
2010
ACM

133views Algorithms» more SODA 2010»

Terrain Guarding is NP-Hard

15 years 26 days ago

Terrain Guarding is NP-Hard

Download www.cs.mcgill.ca

James King, Erik Krohn

Real-time Traffic

Algorithms | SODA 2010 |

claim paper

Related Content

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

» Smugglers and border guards the GeoStar project at RPI

» An Approximation Scheme for Terrain Guarding

» Guarding galleries and terrains

» The Complexity of Guarding Terrains

» Improved Approximations for Guarding 15Dimensional Terrains

» Guarding a terrain by two watchtowers

» Nearoptimal navigation of high speed mobile robots on uneven terrain

Post Info
More Details (n/a)

Added	30 Jan 2011
Updated	30 Jan 2011
Type	Journal
Year	2010
Where	SODA
Authors	James King, Erik Krohn

Comments (0)