The importance of min-max relations to combinatorial optimization was mentioned in Chapter 1. Perhaps the most useful of these is the celebrated max-flow min-cut theorem. Indeed, much of flow theory, and the theory of cuts in graphs, has been built around this theorem. It is not surprising, therefore, that a concerted effort was made to obtain generalizations of this theorem to the case of multiple commodities.
Unable to display preview. Download preview PDF.
- 228.M. Pinsker. On the complexity of a concentrator. In Proc. 7th Annual Teletraffic Conference, pages 318/1–318/4, 1973.Google Scholar