Login / Signup

Parameterized complexity of generalized domination problems.

Petr A. GolovachJan KratochvílOndrej Suchý
Published in: Discret. Appl. Math. (2012)
Keyphrases
  • parameterized complexity
  • np complete
  • simulated annealing
  • incomplete information
  • branch and bound algorithm