Exact Algorithms for NP-Hard Problems: A Survey

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.

• Type: Conference
• Year: 2001
• Where: AUSSOIS
• Authors: Gerhard J. Woeginger
• Keywords: AUSSOIS 2001, Fast Exponential Time, NP-complete Problems, Optimization, Travelling Salesman Problem