Next:
GT32 MAXIMUM EDGE
Up:
Subgraphs and Supergraphs
Previous:
GT30 MINIMUM EDGE
GT31 M
AXIMUM
K
-C
OLORABLE
S
UBGRAPH
I
NSTANCE
: Graph
.
S
OLUTION
: A subset
such that the subgraph
is
k
-colorable, i.e., there is a coloring for
G'
of cardinality at most
k
.
M
EASURE
: Cardinality of the subgraph, i.e.,
|E'|
.
Good News:
Approximable within
[
116
] and [
265
].
Bad News:
A
PX
-complete for
[
284
].
Comment:
Equivalent to M
AXIMUM
K
-C
UT
for unweighted graphs. Admits a PTAS if
and
k=o(|V|)
[
24
].
Viggo Kann
Mon Apr 21 13:07:14 MET DST 1997