Exact Algorithms for NP-Hard Problems: A Survey

@inproceedings{Woeginger2001ExactAF,
  title={Exact Algorithms for NP-Hard Problems: A Survey},
  author={Gerhard J. Woeginger},
  booktitle={Combinatorial Optimization},
  year={2001}
}
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. 
BETA
Highly Influential
This paper has highly influenced 26 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 765 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
SHOWING 1-10 OF 315 CITATIONS, ESTIMATED 41% COVERAGE

765 Citations

0204060'03'06'10'14'18
Citations per Year
Semantic Scholar estimates that this publication has 765 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 45 REFERENCES

Exponential time algorithms for computing the bandwidth of a graph. Manuscript

  • U. Feige, J. Kilian
  • 2000
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…