Hardness and methods to solve CLIQUE

Authors:
Zhu Daming;Luan Junfeng;M. A. Shaohan
Affiliations:
Shandong Univ., Jinan, China;Shandong Univ., Jinan, China;Shandong Univ., Jinan, China
Venue:
Journal of Computer Science and Technology
Year:
2001

Citing 6
Cited 0

Approximating clique is almost NP-complete (preliminary version)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On the complexity of approximating the independent set problem

Information and Computation
Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
On the hardness of approximating minimization problems

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper briefly reviews NP-hard optimization problems and theirin approximability. The hardness of solving CLIQUE problem isspecifically discussed. A dynamic-programming algorithm and its improvedversion for CLIQUE are reviewed and some additional analysis ispresented. The analysis implies that the improved algorithm, HEWN(hierarchical edge-weighted network), only provides a heuristic oruseful method, but cannot be called a polynomial algorithm.