Sciweavers

Share
AUSSOIS
2001
Springer

Exact Algorithms for NP-Hard Problems: A Survey

9 years 11 months ago
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.
Gerhard J. Woeginger
Added 28 Jul 2010
Updated 28 Jul 2010
Type Conference
Year 2001
Where AUSSOIS
Authors Gerhard J. Woeginger
Comments (0)
books