Hardness and methods to solve CLIQUE

Hardness and methods to solve CLIQUE

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computer science and technology 2001-07, Vol.16 (4), p.388-391
Hauptverfasser: Zhu, Daming, Luan, Junfeng, Ma, Shaohan
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Hardness
Heuristic
Networks
Optimization
Polynomials
Studies
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1000-9000
1860-4749
DOI:10.1007/BF02948987