Sign in

On the hardness of full Steiner tree problems.

Ahmad BiniazAnil MaheshwariMichiel H. M. Smid
Published in: J. Discrete Algorithms (2015)
Keyphrases
  • steiner tree
  • np complete
  • decision making
  • neural network
  • reinforcement learning
  • search space
  • cost function
  • np hard
  • optimization problems
  • facility location