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.
1/52<strong>Fast</strong> <strong>Exponential</strong>-<strong>Time</strong> <strong>Algorithms</strong>BranchingThe Algorithm of Fomin et al.The Maximum Independent Set Algorithm of Fomin et al.Maximum Independent Setsimple Branch & Reduce algorithmrunning time O(1.2202 n )polynomial spacetime analysis based on Measure and Conquerlower bound of Ω(1.1224 n ) for the (unknown) worst caserunning time of the algorithmthe (known) running time of such Branch & Reduce algorithmmight be “far” from the (unknown) worst case running time of thealgorithm
Change language