Exact Algorithms for NP-Hard Problems: A Survey [chapter]

Gerhard J. Woeginger
2003 Lecture Notes in Computer Science  
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open problems in this area. The list of discussed NP-complete problems includes the travelling salesman problem, scheduling under precedence constraints, satisfiability, knapsack, graph coloring, independent sets in graphs, bandwidth of a graph, and many more.
doi:10.1007/3-540-36478-1_17 fatcat:5m4p25aq65gpjnbwxsbxgrsnz4