On a minimax realization problem on flow networks

Abstract

We consider a realization problem of an undirected flow network N from a matrix M. We assume that M is not always a terminal capacity matrix. In our previous study, we considered a problem to minimize the differences between capacities between vertex pairs in N, and elements of M. We called this problem "minimax realization problem." In this paper, we propose another minimax realization problem and propose an algorithm to minimize the differences.