Approximation algorithms to minimum vertex cover problems on polygons and terrains

Authors:
Ana Paula Tomás;António Leslie Bajuelos;Fábio Marques
Affiliations:
DCC-FC & LIACC, University of Porto, Portugal;Department of Mathematics, R&D Unit "Mathematics and Applications", University of Aveiro, Portugal;School of Technology and Management, University of Aveiro, Portugal
Venue:
ICCS'03 Proceedings of the 1st international conference on Computational science: PartI
Year:
2003

Citing 4
Cited 1

Computational complexity of art gallery problems

IEEE Transactions on Information Theory
Introduction to algorithms

Introduction to algorithms
Approximation algorithms for terrain guarding

Information Processing Letters
Placing Base Stations in Wireless Indoor Communication Networks

IEEE Intelligent Systems

Minimum vertex guard problem for orthogonal polygons: a genetic approach

MAMECTIS'08 Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.