ON TWO APPROXIMATION ALGORITHMS FOR THE CLIQUE PROBLEM
1993 ◽
Vol 04
(02)
◽
pp. 117-133
Keyword(s):
We look at well-known polynomial-time approximation algorithms for the optimization problem MAX-CLIQUE (“find the size of the largest clique in a graph”) with regard to how easy it is to compute the actual cliques yielded by these approximation algorithms. We show that even for two “pretty useless” deterministic polynomial-time approximation algorithms, it is unlikely that the resulting clique can be computed efficiently in parallel. We also show that for each non-deterministic algorithm, it is unlikely that there is some deterministic polynomial-time algorithm that decides whether any given vertex appears in some clique yielded by that nondeterministic algorithm.
2009 ◽
Vol 19
(03)
◽
pp. 267-288
◽
2013 ◽
pp. 132-143
2016 ◽
Vol 33
(3)
◽
pp. 809-813
◽
2002 ◽
Vol 13
(04)
◽
pp. 613-627
◽
2005 ◽
pp. 462-475
◽
1999 ◽
Vol 2
(5)
◽
pp. 203-213
◽