Login / Signup
Parameterized Hardness of Art Gallery Problems.
Édouard Bonnet
Tillmann Miltzow
Published in:
ACM Trans. Algorithms (2020)
Keyphrases
</>
np complete
art gallery
scheduling problem
image processing
computational complexity
np hard
optimization problems
heuristic search
branch and bound algorithm
benchmark problems
combinatorial optimization problems