, a weight function
, and an
integer
.
.
[
116
] and [
265
].
and a subset
S
of
V
, and the problem
is to find the 2-cut of weight at least
W
with the largest number of
vertices from
S
on the same side as
,
is not approximable within
for some
[
352
].
Viggo Kann