book chapterLecture notes in computer scienceJan 1, 2003Closed access

Exact Algorithms for NP-Hard Problems: A Survey

GJGerhard J. Woeginger

University of Twente

Indexed incrossref

Abstract

No abstract available for this paper.

Citation impact

650
total citations
FWCI
28.67
Percentile
100%
References
50
Citations per year

Authors

1

Topics & keywords

Topics
Keywords
  • Computer science
  • Knapsack problem
  • Travelling salesman problem
  • Boolean satisfiability problem
  • Graph coloring
  • Satisfiability
  • Scheduling (production processes)
  • Graph
No related works found for this paper.