Abstract
The stage illumination problem presented by Urrutia in 1992 is one of illumination problems, which uses floodlights for illuminating a stage. The problem asks whether or not it is possible to rotate given floodlights around their apexes so as to obtain a final configuration such that a given stage is completely illuminated. The problem for finding a polynomial time algorithm for this problem or proving NP-hardness of this problem was open. This paper shows that it is NP-complete even with some restrictions.
Cite
CITATION STYLE
Ito, H., Uehara, H., & Yokoyama, M. (2000). Np-completeness of stage illumination problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1763, pp. 158–165). Springer Verlag. https://doi.org/10.1007/978-3-540-46515-7_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
