Date: 30 Jan 2003

Exact Algorithms for NP-Hard Problems: A Survey

* Final gross prices may vary according to local VAT.

Get Access


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.