Descripción
|
|
---|---|
In this paper we propose four approximation algorithms (metaheuristic based), for the Minimum Vertex Floodlight Set problem. Urrutia et al. [9] solved the combinatorial problem, although it is strongly believed that the algorithmic problem is NP-hard. We conclude that, on average, the minimum number of vertex floodlights needed to illuminate a orthogonal polygon with n vertices is n/4,29. | |
Internacional
|
Si |
Nombre congreso
|
XIV Spanish Meeting on Computacional Geometry, EGC2011 |
Tipo de participación
|
960 |
Lugar del congreso
|
Alcalá de Henares, Madrid |
Revisores
|
Si |
ISBN o ISSN
|
2014-2323 |
DOI
|
|
Fecha inicio congreso
|
27/06/2011 |
Fecha fin congreso
|
30/06/2011 |
Desde la página
|
83 |
Hasta la página
|
86 |
Título de las actas
|
Proc. of XIV Spanish Meeting on Computacional Geometry, |