Vertex-to-point conflict-free chromatic guarding is NP-hard
From MaRDI portal
Publication:2154089
DOI10.1007/978-3-030-96731-4_10OpenAlexW4225706386MaRDI QIDQ2154089
Chuzo Iwamoto, Tatsuaki Ibusuki
Publication date: 13 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-96731-4_10
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational complexity of the chromatic art gallery problem for orthogonal polygons
- A combinatorial theorem in plane geometry
- Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
- On conflict-free chromatic guarding of simple polygons
- Conflict-free chromatic art gallery coverage
- On guarding the vertices of rectilinear domains
- Computational complexity of art gallery problems
- Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons
- Planar 3-SAT with a clause/variable cycle
- Inapproximability results for guarding polygons and terrains
This page was built for publication: Vertex-to-point conflict-free chromatic guarding is NP-hard