A DIFFICULT PROBLEM:
MINIMUM CONGESTION ROUTING
route the flows so that the
MAXIMUM
congestion is
MINIMIZED
congestion on a link of the network = total flow on that link
>
