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.
38/52<strong>Fast</strong> <strong>Exponential</strong>-<strong>Time</strong> <strong>Algorithms</strong>BranchingThe Algorithm of Fomin et al.Measure & ConquerA standard analysis of the worst case running time would establishrunning time O(1.3251 n ) for the algorithm. [Tarjan, TrojanowskiO(1.2600 n ) ! !]A better choice of the measure of a problem instance mayallow <strong>to</strong> obtain a better upper bound on the worst caserunning time of the same algorithm.Thus a nonstandard measure is a <strong>to</strong>ol <strong>to</strong> improve theanalysis of the worst case running time of Branch & Reducealgorithms.
Change language