A two‐commodity sharing problem on networks
Tetsuo Ichimori, Naoki Katoh · Networks · 1991
Abstract This paper considers a sharing problem of distributing a given quantity of resources to a set of demand nodes in a network as equally as possible. We study the case in which the resources are of two distinct kinds and propose a polynomial time algorithm for it by reducing the problem to the one‐commodity sharing problem.