- Approximate evaluation of a linear function at the vertices of the unit $n$-dimensional cube On the growth of coefficients in an integral linear aggregation A fast algorithm for constructing a maximum flow through a network On the extremality of the rank function of a connected semimodular lattice On polynomial solvability conditions for the simplest plant location problem Minimal mean weight cuts and cycles in directed graphs An algorithm for determining a maximum packing of odd-terminus cuts, and its applications Maximum- and minimum-cost multicommodity flow problems having unbounded fractionality On a class of maximum multicommodity flow problems with integer optimal solutions On edge mappings of graphs preserving subgraphs of a given type On edge semi-isomorphisms of graphs induced by their isomorphisms Constructions of cubic bipartite 3-connected graphs without Hamiltonian cycles Nonseparating circuits and the planarity of graph-cells Extremal sets and covering and packing problems in matroids Optimal distribution sorting Branching packing in weighted graphs Non-3-crossing families and multicommodity flows The vector shortest path problem in the $l_\infty $-norm Lower performance bounds for on-line algorithms in the simple two-dimensional rectangle packing problems

This is a collection of translations of a variety of papers on discrete mathematics by members of the Moscow Seminar on Discrete Mathematics. This seminar, begun in 1972, was marked by active participation and intellectual ferment. Mathematicians in the USSR often encountered difficulties in publishing, so many interesting results in discrete mathematics remained unknown in the West for some years, and some are unknown even to the present day. To help fill this communication gap, this collection offers papers that were obscurely published and very hard to find. Among the topic covered here are: graph theory, network flow and multicommodity flow, linear programming and combinatorial optimization, matroid theory ad submodular systems, matrix theory and combinatorics, parallel computing, complexity of algorithms, random graphs and statistical mechanics, coding theory, and algebraic combinatorics and group theory.

(source: Nielsen Book Data)