Backtracking And Branch And Bound
•
Subset problem of size
n
.
±
Nonsystematic search of the space for the answer takes
O(p2
n
)
time, where
p
is the time needed to evaluate
each member of the solution space.
•
Permutation problem of size
n
.
±
Nonsystematic search of the space for the answer takes
O(pn!)
time, where
p
is the time needed to evaluate
each member of the solution space.
•
Backtracking and branch and bound perform a
systematic search; often taking much less time
than taken by a nonsystematic search.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentTree Organization Of Solution Space
•
Set up a tree structure such that the leaves
represent members of the solution space.
•
For a size
n
subset problem, this tree structure has
2
n
leaves.
•
For a size
n
permutation problem, this tree
structure has
n!
leaves.
•
The tree structure is too big to store in memory; it
also takes too much time to create the tree
structure.
•
Portions of the tree structure are created by the
backtracking and branch and bound algorithms as
needed.
Subset Problem
This is the end of the preview.
Sign up
to
access the rest of the document.
 Fall '08
 Davis
 Graph Theory, Backtracking, Depthfirst search, Search algorithm, Tree structure

Click to edit the document details