Vertex-to-Point Conflict-Free Chromatic Guarding is NP-Hard
Authors:
- 16 March 2022
- book chapter
- Published by Springer Nature
- p. 111-122
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Tight bounds for conflict-free chromatic guarding of orthogonal art galleriesComputational Geometry, 2018
- Facets for Art Gallery ProblemsAlgorithmica, 2014
- Conflict-Free Chromatic Art Gallery CoverageAlgorithmica, 2013
- On guarding the vertices of rectilinear domainsComputational Geometry, 2007
- On the rectilinear art gallery problem2005
- Inapproximability Results for Guarding Polygons and TerrainsAlgorithmica, 2001
- Two NP‐Hard Art‐Gallery Problems for Ortho‐PolygonsMathematical Logic Quarterly, 1995
- Computational complexity of art gallery problemsIEEE Transactions on Information Theory, 1986
- Computational Geometry1985
- A combinatorial theorem in plane geometryJournal of Combinatorial Theory, Series B, 1975