Sciweavers

ICCS
2003
Springer

Approximation Algorithms to Minimum Vertex Cover Problems on Polygons and Terrains

13 years 7 months ago
Approximation Algorithms to Minimum Vertex Cover Problems on Polygons and Terrains
We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may be directly extended to terrains along the lines of [4]. A major idea in our approach is to explore dominance of visibility regions to first detect pieces that are more difficult to guard.
Ana Paula Tomás, António Leslie Baju
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where ICCS
Authors Ana Paula Tomás, António Leslie Bajuelos, Fábio Marques
Comments (0)