ON TWO APPROXIMATION ALGORITHMS FOR THE CLIQUE PROBLEM
From MaRDI portal
Publication:4286115
DOI10.1142/S0129054193000080zbMATH Open0802.68093MaRDI QIDQ4286115
Publication date: 27 March 1994
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
complexityapproximation algorithmsgreedy algorithms\(\mathbb{P}\)-completeoptimization problem MAX-CLIQUE
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (7)
Approximating 2-cliques in unit disk graphs ⋮ A 2-approximation algorithm for the graph 2-clustering problem ⋮ A note on improved results for one round distributed clique listing ⋮ Approximation Algorithms for the k-Clique Covering Problem ⋮ On approximating the number of k-cliques in sublinear time ⋮ A clique search problem and its application to machine scheduling ⋮ Worst-case analysis of clique MIPs
This page was built for publication: ON TWO APPROXIMATION ALGORITHMS FOR THE CLIQUE PROBLEM
