Hardcover ISBN:  9780821875094 
Product Code:  TRANS2/158 
List Price:  $175.00 
MAA Member Price:  $157.50 
AMS Member Price:  $140.00 
eBook ISBN:  9781470433697 
Product Code:  TRANS2/158.E 
List Price:  $165.00 
MAA Member Price:  $148.50 
AMS Member Price:  $132.00 
Hardcover ISBN:  9780821875094 
eBook: ISBN:  9781470433697 
Product Code:  TRANS2/158.B 
List Price:  $340.00 $257.50 
MAA Member Price:  $306.00 $231.75 
AMS Member Price:  $272.00 $206.00 
Hardcover ISBN:  9780821875094 
Product Code:  TRANS2/158 
List Price:  $175.00 
MAA Member Price:  $157.50 
AMS Member Price:  $140.00 
eBook ISBN:  9781470433697 
Product Code:  TRANS2/158.E 
List Price:  $165.00 
MAA Member Price:  $148.50 
AMS Member Price:  $132.00 
Hardcover ISBN:  9780821875094 
eBook ISBN:  9781470433697 
Product Code:  TRANS2/158.B 
List Price:  $340.00 $257.50 
MAA Member Price:  $306.00 $231.75 
AMS Member Price:  $272.00 $206.00 

Book DetailsAmerican Mathematical Society Translations  Series 2Volume: 158; 1994; 221 ppMSC: Primary 05; 68; 90
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 topics covered here are: graph theory, network flow and multicommodity flow, linear programming and combinatorial optimization, matroid theory and submodular systems, matrix theory and combinatorics, parallel computing, complexity of algorithms, random graphs and statistical mechanics, coding theory, and algebraic combinatorics and group theory.
ReadershipResearch mathematicians.

Table of Contents

Chapters

L. G. Babat — Approximate evaluation of a linear function at the vertices of the unit $n$dimensional cube

L. G. Babat — On the growth of coefficients in an integral linear aggregation

B. V. Cherkasskiĭ — A fast algorithm for constructing a maximum flow through a network

V. P. Grishukhin — On the extremality of the rank function of a connected semimodular lattice

V. P. Grishukhin — On polynomial solvability conditions for the simplest plant location problem

A. V. Karzanov — Minimal mean weight cuts and cycles in directed graphs

A. V. Karzanov — An algorithm for determining a maximum packing of oddterminus cuts, and its applications

A. V. Karzanov — Maximum and minimumcost multicommodity flow problems having unbounded fractionality

A. V. Karzanov — On a class of maximum multicommodity flow problems with integer optimal solutions

A. K. Kelmans — On edge mappings of graphs preserving subgraphs of a given type

A. K. Kelmans — On edge semiisomorphisms of graphs induced by their isomorphisms

A. K. Kelmans — Constructions of cubic bipartite 3connected graphs without Hamiltonian cycles

A. K. Kelmans — Nonseparating circuits and the planarity of graphcells

A. K. Kelmans and V. P. Polesskiĭ — Extremal sets and covering and packing problems in matroids

E. V. Kendys, V. M. Makarov, A. R. Rubinov and E. M. Tishkin — Optimal distribution sorting

P. A. Pevzner — Branching packing in weighted graphs

P. A. Pevzner — Non3crossing families and multicommodity flows

A. D. Vaĭnshteĭn — The vector shortest path problem in the $l_\infty $norm

A. D. Vaĭnshteĭn — Lower performance bounds for online algorithms in the simple twodimensional rectangle packing problems


RequestsReview Copy – for publishers of book reviewsPermission – for use of book, eBook, or Journal contentAccessibility – to request an alternate format of an AMS title
 Book Details
 Table of Contents
 Requests
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 topics covered here are: graph theory, network flow and multicommodity flow, linear programming and combinatorial optimization, matroid theory and submodular systems, matrix theory and combinatorics, parallel computing, complexity of algorithms, random graphs and statistical mechanics, coding theory, and algebraic combinatorics and group theory.
Research mathematicians.

Chapters

L. G. Babat — Approximate evaluation of a linear function at the vertices of the unit $n$dimensional cube

L. G. Babat — On the growth of coefficients in an integral linear aggregation

B. V. Cherkasskiĭ — A fast algorithm for constructing a maximum flow through a network

V. P. Grishukhin — On the extremality of the rank function of a connected semimodular lattice

V. P. Grishukhin — On polynomial solvability conditions for the simplest plant location problem

A. V. Karzanov — Minimal mean weight cuts and cycles in directed graphs

A. V. Karzanov — An algorithm for determining a maximum packing of oddterminus cuts, and its applications

A. V. Karzanov — Maximum and minimumcost multicommodity flow problems having unbounded fractionality

A. V. Karzanov — On a class of maximum multicommodity flow problems with integer optimal solutions

A. K. Kelmans — On edge mappings of graphs preserving subgraphs of a given type

A. K. Kelmans — On edge semiisomorphisms of graphs induced by their isomorphisms

A. K. Kelmans — Constructions of cubic bipartite 3connected graphs without Hamiltonian cycles

A. K. Kelmans — Nonseparating circuits and the planarity of graphcells

A. K. Kelmans and V. P. Polesskiĭ — Extremal sets and covering and packing problems in matroids

E. V. Kendys, V. M. Makarov, A. R. Rubinov and E. M. Tishkin — Optimal distribution sorting

P. A. Pevzner — Branching packing in weighted graphs

P. A. Pevzner — Non3crossing families and multicommodity flows

A. D. Vaĭnshteĭn — The vector shortest path problem in the $l_\infty $norm

A. D. Vaĭnshteĭn — Lower performance bounds for online algorithms in the simple twodimensional rectangle packing problems