Vertex-to-Point Conflict-Free Chromatic Guarding is NP-Hard.
Chuzo IwamotoTatsuaki IbusukiPublished in: WALCOM (2022)
Keyphrases
- conflict free
- np hard
- functional dependencies
- scheduling problem
- optimal solution
- np complete
- database schemes
- special case
- color images
- computational complexity
- lower bound
- worst case
- multivalued dependencies
- greedy heuristic
- approximation algorithms
- directed graph
- decision problems
- linear programming
- databases
- minimum weight
- relational databases
- multi agent systems
- case study