Hardness and methods to solve CLIQUE
- 47 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.
- Cook S. The complexity of theorem-proving procedures. InProceedings of 3rd ACM Symp. Theory of Computing, 1971, pp.151–158.Google Scholar
- Karp R M. Reducibility Among Combinatorial Problems. Complexity of Computer Computations, Miller, Thatcher (eds.), Plenum Press, 1972, pp.85–103.Google Scholar
- Levin L. Universal search problems.Problemy Peredachi Informatsii, 1973, 9(3): 265–266. (in Russian)Google Scholar
- Arora S, Safra S. Probabilistic checking of proofs: A new characterization of NP. InProceedings of 33rd IEEE Symp. Foundations of Computer Science, 1992, pp.2–13.Google Scholar
- Arora S, Lund C, Motwani R,et al. Proof verification and intractability of approximation problems. InProceedings of 33rd IEEE Symp. Foundations of Computer Science, 1992, pp.13–22.Google Scholar
- Tang Pushan. An algorithm with polynomial time complexity for finding clique in a graph. InProceedings of 5th International Conference on CAD&CG, Shenzhen, P. R. China, 1997, pp.500–505.Google Scholar
- Dorit S Hochbaum. Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, 1997.Google Scholar
- Feige U, Goldwasser S, Lovasz L,et al. Approximating clique is almost NP-complete. InProceedings of 32nd IEEE Symposium on Foundations of Computer Science, 1991, pp.2–12.Google Scholar
- Zukerman D. NP-complete problems have a version that’s hard to approximate. InProceedings of 8th Structure in Complexity Theory Conference, 1993, pp.305–312.Google Scholar