Login / Signup

The Searching over Separators Strategy To Solve Some NP-Hard Problems in Subexponential Time.

R. Z. HwangR. C. ChangRichard C. T. Lee
Published in: Algorithmica (1993)
Keyphrases
  • np hard problems
  • constraint programming
  • np hard
  • knapsack problem
  • search strategies
  • combinatorial search
  • optimization problems
  • graph coloring
  • difficult problems