Login / Signup

Bandwidth Constrained NP-Complete Problems.

Burkhard MonienIvan Hal Sudborough
Published in: Theor. Comput. Sci. (1985)
Keyphrases
  • np complete problems
  • np complete
  • graph coloring
  • phase transition
  • hard problems
  • sat problem
  • special case
  • genetic algorithm
  • objective function
  • np hard
  • job shop scheduling