Login / Signup
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems.
Jianer Chen
Iyad A. Kanj
Ge Xia
Published in:
Algorithmica (2005)
Keyphrases
</>
search tree
upper bound
np hard problems
branch and bound algorithm
lower bound
worst case
np hard
search algorithm
search space
depth first search
nearest neighbor
binary search trees