and a rational
b
,
.
and
no edge has one endpoint in
A
and one in
B
.
for any
,
even for graphs of maximum degree 3.
[
60
].
can be found in
polynomial time [
260
].
An
f(|V|)
-approximation algorithm is also a
algorithm for
M
INIMUM
B
-B
ALANCED
C
UT
[
60
].
Viggo Kann