Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Stephan Eidenbenz. Finding minimum hidden guard sets in polygons - tight approximability results. Comput. Geom., 34(2):49-57, 2006. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and TerrainsStephan Eidenbenz. swat 2002: 60-68 [doi] Inapproximability of finding maximum hidden sets on polygons and terrainsStephan Eidenbenz. comgeo, 21(3):139-153, 2002. Inapproximability Results for Guarding Polygons and TerrainsStephan Eidenbenz, Christoph Stamm, Peter Widmayer. algorithmica, 31(1):79-113, 2001. [doi]
The following publications are possibly variants of this publication: