Journal of Computer Science and Technology

, Volume 16, Issue 4, pp 388–391 | Cite as

Hardness and methods to solve CLIQUE

Notes
  • 47 Downloads

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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Cook S. The complexity of theorem-proving procedures. InProceedings of 3rd ACM Symp. Theory of Computing, 1971, pp.151–158.Google Scholar
  2. [2]
    Karp R M. Reducibility Among Combinatorial Problems. Complexity of Computer Computations, Miller, Thatcher (eds.), Plenum Press, 1972, pp.85–103.Google Scholar
  3. [3]
    Levin L. Universal search problems.Problemy Peredachi Informatsii, 1973, 9(3): 265–266. (in Russian)Google Scholar
  4. [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.Google Scholar
  5. [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.Google Scholar
  6. [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.Google Scholar
  7. [7]
    Tang Pushan, Huang Zhijun, HEWN: A polynomial algorithm for CLIQUE problem.Journal of Computer Science& Technology, 1998, 13(Supplement): 33–44.MATHMathSciNetGoogle Scholar
  8. [8]
    Papadimitriou C, Yannakakis M. Optimization, approximation and complexity classes.J. Computer and System Science, 1991, 43: 425–440.MATHCrossRefMathSciNetGoogle Scholar
  9. [9]
    Berman P, Schnitger G. On the complexity of approximating the independent set problem.Information and Computation, 1992, 96(1): 77–94.MATHCrossRefMathSciNetGoogle Scholar
  10. [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.MATHGoogle Scholar
  11. [11]
    Dorit S Hochbaum. Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, 1997.Google Scholar
  12. [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.Google Scholar
  13. [13]
    Lund C, Yannakakis M. On the hardness of approximating minimization problems.Journal of the ACM, 1994, 41(5): 960–981.MATHCrossRefMathSciNetGoogle Scholar
  14. [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.Google Scholar

Copyright information

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

Authors and Affiliations

  1. 1.Department of Computer ScienceShandong UniversityJinanP.R. China

Personalised recommendations