Summary
l
Nonuniform sampling for cuts and flows
l
Approximate cuts in
O
(
n
2
)
time
»
for arbitrary flow value
l
Max flow in
O
(
nv
)
time
»
only useful for “small” flow value
»
but does work for weighted graphs
»
large flow open