Hardness and methods to solve CLIQUE
- 46 Downloads
The paper briefly reviews NP-hard optimization problems and their inapproximability. The hardness of solving CLIQUE problem is specifically discussed. A dynamic-programming algorithm and its improved version for CLIQUE are reviewed and some additional analysis is presented. The analysis implies that the improved algorithm, HEWN (hierarchical edge-weighted network), only provides a heuristic or useful method, but cannot be called a polynomial algorithm.
Keywordsalgorithm NP-hardness approximation ratio dynamic programming complexity
Unable to display preview. Download preview PDF.