## Exact algorithms for NP-hard problems: A survey

by
Gerhard J. Woeginger

Venue: | Combinatorial Optimization - Eureka, You Shrink!, LNCS |

Citations: | 113 - 3 self |

### BibTeX

@ARTICLE{Woeginger_exactalgorithms,

author = {Gerhard J. Woeginger},

title = {Exact algorithms for NP-hard problems: A survey},

journal = {Combinatorial Optimization - Eureka, You Shrink!, LNCS},

year = {},

pages = {185--207}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract. 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. 1