Observatorio de I+D+i UPM

Memorias de investigación
Communications at congresses:
Solving the Minimum Vertex Floodlight Problem with Hybrid Metaheuristics
Year:2011
Research Areas
  • Information technology and adata processing
Information
Abstract
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.
International
Si
Congress
XIV Spanish Meeting on Computacional Geometry, EGC2011
960
Place
Alcalá de Henares, Madrid
Reviewers
Si
ISBN/ISSN
2014-2323
Start Date
27/06/2011
End Date
30/06/2011
From page
83
To page
86
Proc. of XIV Spanish Meeting on Computacional Geometry,
Participants
  • Autor: Gregorio Hernandez Peñalver (UPM)
  • Autor: Antonio Bajuelos (Universidade de Aveiro)
  • Autor: Ana Mafalda Martins (Universidade de Aveiro)
  • Autor: Santiago Canales (Universidad Pontificia Comillas, ICAI)
Research Group, Departaments and Institutes related
  • Creador: Departamento: Matemática Aplicada (Facultad de Informática)
S2i 2019 Observatorio de investigación @ UPM con la colaboración del Consejo Social UPM
Cofinanciación del MINECO en el marco del Programa INNCIDE 2011 (OTR-2011-0236)
Cofinanciación del MINECO en el marco del Programa INNPACTO (IPT-020000-2010-22)