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.
7/52<strong>Fast</strong> <strong>Exponential</strong>-<strong>Time</strong> <strong>Algorithms</strong>IntroductionHis<strong>to</strong>rySome New <strong>Algorithms</strong>Last DecadeBANDWIDTH O ∗ (10 n ) Feige, Kilian (2000)3-SAT O(1.4802 n ) Dantsin et al. (2002)MAXIMUM CUT O(1.7315 n ) Williams (ICALP 2004)TREEWIDTH O(1.9601 n ) Fomin et al. (ICALP 2004)3-COLORING O(1.3289 n ) Beigel, Eppstein (2005)DOMINATING SET O(1.5137 n ) Fomin et al. (ICALP 2005)COLORING O ∗ (2 n ) Björklund, Husfeldt (FOCS 2006)
Change language