000			02070nmm a2200181Ia 4500
008			230301s9999||||xx |||||||||||||||||und||
020			_a9781470433697 (online)
245		0	_aSelected topics in discrete mathematics : _bproceedings of the Moscow Discrete Mathematics Seminar, 1972-1990 / _cA.K. Kelmans, editor. _hSeries 2, volume 158
260			_aProvidence, R.I. : _bAmerican Mathematical Society, _cc1994.
300			_a1 online resource (xiii, 221 p. : ill.)
490			_aAmerican Mathematical Society Translations: Series 2,
500			_a"A collection of translations of ... papers"--Pref.
504			_aIncludes bibliographical references.
505			_tApproximate 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
650			_aMathematicsComputer science
700			_aKelmans, A. K.
856			_uhttp://www.ams.org/trans2/158
999			_c28225 _d28225