Inapproximability Results for Guarding Polygons without Holes

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.