Next:
GT21 MAXIMUM INDEPENDENT
Up:
Subgraphs and Supergraphs
Previous:
Subgraphs and Supergraphs
GT20 M
AXIMUM
C
LIQUE
I
NSTANCE
: Graph
.
S
OLUTION
: A clique in
G
, i.e. a subset
such that every two vertices in
V'
are joined by an edge in
E
.
M
EASURE
: Cardinality of the clique, i.e.,
|V'|
.
Good News:
Approximable within
[
59
].
Bad News:
Not approximable within
for any
[
40
].
Comment:
Not approximable within
for any
, unless co-RP=NP [
163
]. The same problem as M
AXIMUM
I
NDEPENDENT
S
ET
on the complementary graph. Approximable within
if
[
7
] and [
265
]. The vertex weighted version is approximable within
[
152
].
Garey and Johnson:
GT19
Viggo Kann
Mon Apr 21 13:07:14 MET DST 1997