The Bounded Search Tree Algorithm for the Closest String Problem Has Quadratic Smoothed Complexity.
Christina BoucherPublished in: MFCS (2011)
Keyphrases
- computational complexity
- search tree
- worst case
- dynamic programming
- objective function
- depth first search
- space complexity
- search space
- binary search trees
- search algorithm
- cost function
- np hard
- bin packing
- branching factor
- search strategy
- particle swarm optimization
- optimization problems
- data structure
- optimal solution