Stephan Eidenbenz. Inapproximability Results for Guarding Polygons without Holes. In Kyung-Yong Chwa, Oscar H. Ibarra, editors, Algorithms and Computation, 9th International Symposium, ISAAC 98, Taejon, Korea, December 14-16, 1998, Proceedings. Volume 1533 of Lecture Notes in Computer Science, pages 427-436, Springer, 1998. [doi]
@inproceedings{Eidenbenz98,
title = {Inapproximability Results for Guarding Polygons without Holes},
author = {Stephan Eidenbenz},
year = {1998},
url = {http://link.springer.de/link/service/series/0558/bibs/1533/15330427.htm},
researchr = {https://researchr.org/publication/Eidenbenz98},
cites = {0},
citedby = {0},
pages = {427-436},
booktitle = {Algorithms and Computation, 9th International Symposium, ISAAC 98, Taejon, Korea, December 14-16, 1998, Proceedings},
editor = {Kyung-Yong Chwa and Oscar H. Ibarra},
volume = {1533},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-65385-6},
}