MIT
95
Summary
lNonuniform
sampling for cuts and flows
lApproximate
cuts in O(n2) time
»for
arbitrary flow value
lMax
flow in O(nv) time
»only
useful for “small” flow value
»but
does work for weighted graphs
»large
flow open