Login / Signup
Generalized distance domination problems and their complexity on graphs of bounded mim-width.
Lars Jaffke
O-joung Kwon
Torstein J. F. Strømme
Jan Arne Telle
Published in:
CoRR (2018)
Keyphrases
</>
decision problems
benchmark problems
polynomial time complexity
worst case
optimization problems
np complete
distance function
solving problems
reinforcement learning
search space
distance metric
combinatorial optimization
problems involving
np hardness
polynomial hierarchy