Login / Signup

Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems.

Jianer ChenIyad A. KanjGe Xia
Published in: ISAAC (2003)
Keyphrases
  • search tree
  • upper bound
  • np hard problems
  • lower bound
  • branch and bound algorithm
  • search algorithm
  • search space
  • genetic algorithm
  • worst case
  • constraint programming
  • knapsack problem