:" For his continuing contributions to the theory of algorithms including the development of efficient algorithms for network flow and other combinatorial optimization problems, the identification of polynomial-time computability with the intuitive notion of algorithmic efficiency, and, most notably, contributions to the theory of NP-completeness.
32.
In the case of network flows, Unicast or Multicast, a minimum cost flow ( MCF ) in graph " G " is calculated based on the declared costs " d " " k " of each of the links and payment is calculated as follows:
