Hardness and methods to solve CLIQUE Authors Zhu Daming Department of Computer Science Shandong University Luan Junfeng Department of Computer Science Shandong University Ma Shaohan Department of Computer Science Shandong University Notes

Received: 11 September 2000 Revised: 16 April 2001 DOI :
10.1007/BF02948987

Cite this article as: Zhu, D., Luan, J. & Ma, S. J. Comput. Sci. & Technol. (2001) 16: 388. doi:10.1007/BF02948987
Abstract 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.

Keywords algorithm NP-hardness approximation ratio dynamic programming complexity Supported by the National Natural Science Foundation of China (Nos.69873027, 60073042).

Download to read the full article text

References [1]

Cook S. The complexity of theorem-proving procedures. InProceedings of 3rd ACM Symp. Theory of Computing , 1971, pp.151–158.

[2]

Karp R M. Reducibility Among Combinatorial Problems. Complexity of Computer Computations, Miller, Thatcher (eds.), Plenum Press, 1972, pp.85–103.

[3]

Levin L. Universal search problems.Problemy Peredachi Informatsii , 1973, 9(3): 265–266. (in Russian)

[4]

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.

[5]

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.

[6]

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.

[7]

Tang Pushan, Huang Zhijun, HEWN: A polynomial algorithm for CLIQUE problem.

Journal of Computer Science& Technology , 1998, 13(Supplement): 33–44.

MATH MathSciNet [8]

Papadimitriou C, Yannakakis M. Optimization, approximation and complexity classes.

J. Computer and System Science , 1991, 43: 425–440.

MATH CrossRef MathSciNet [9]

Berman P, Schnitger G. On the complexity of approximating the independent set problem.

Information and Computation , 1992, 96(1): 77–94.

MATH CrossRef MathSciNet [10]

Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness. San Franciso: W. H. Freeman Company, 1979.

MATH [11]

Dorit S Hochbaum. Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, 1997.

[12]

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.

[13]

Lund C, Yannakakis M. On the hardness of approximating minimization problems.

Journal of the ACM , 1994, 41(5): 960–981.

MATH CrossRef MathSciNet [14]

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.

© Science Press, Beijing China and Allerton Press Inc. 2001