Descripción
|
|
---|---|
The problem of minimizing the number of guards placed on vertices needed to guard a given simple polygon (MINIMUM VERTEX GUARD problem) is NP-hard. This computational complexity opens two lines of investigation: the development of algorithms that determine approximate solutions and the determination of optimal solutions for special classes of simple polygons. In this paper we follow the first line of investigation proposing an approximation algorithm based on the general metaheuristic Genetic Algorithms to solve the MINIMUM VERTEX GUARD problem. | |
Internacional
|
Si |
Nombre congreso
|
10th WSEAS International Conference on Mathematical Methods, Computational Techniques and Inteligent Systems (MAMECTIS '08), |
Tipo de participación
|
960 |
Lugar del congreso
|
Corfú, Grecia |
Revisores
|
Si |
ISBN o ISSN
|
978-960-474-012-3 |
DOI
|
|
Fecha inicio congreso
|
26/10/2008 |
Fecha fin congreso
|
28/10/2008 |
Desde la página
|
78 |
Hasta la página
|
84 |
Título de las actas
|
Proceedings of the 10th WSEAS International Conference on Mathematical Methods, Computational Techniques and Inteligent Systems (MAMECTIS '08), |