Fast Exponential-Time Algorithms to solve NP-complete ... - Lita
Fast Exponential-Time Algorithms to solve NP-complete ... - Lita
Fast Exponential-Time Algorithms to solve NP-complete ... - Lita
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
4/52<strong>Fast</strong> <strong>Exponential</strong>-<strong>Time</strong> <strong>Algorithms</strong>BranchingBranch & ReduceBranch & Reduce <strong>Algorithms</strong>Branch & Reduce algorithms(also called backtracking or search tree algorithms) :recursively applied <strong>to</strong> problem instances using Branching rulesand Reduction rules.Branching rules : solving the problem by recursively solvingsmaller instancesReduction rules :- simplify the instance- (typically) reduce the size of the instance
Change language