Was the theoretical lower bound of this `max-flow' algo known? Just curious.

Also, are there a class of algorithms where the current practical state of the art differs greatly from the theoretical or how would I go about finding out the answer to this question? Much obliged.

I kind of thought a lot of these routing problems were worked out or known not to be work-out-able. Just shows what I know :/ * sigh