Selected topics in discrete mathematics : proceedings of the Moscow Discrete Mathematics Seminar, 1972-1990 / A.K. Kelmans, editor. Series 2, volume 158

Contributor(s): Kelmans, A. KMaterial type: Computer fileComputer fileSeries: American Mathematical Society Translations: Series 2Publication details: Providence, R.I. : American Mathematical Society, c1994Description: 1 online resource (xiii, 221 p. : ill.)ISBN: 9781470433697 (online)Subject(s): MathematicsComputer scienceOnline resources: Click here to access online
Contents:
Approximate evaluation of a linear function at the vertices of the unit
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current library Call number URL Status Date due Barcode Item holds
electronic book electronic book
Link to resource Accessible Online EBK20812
Total holds: 0

"A collection of translations of ... papers"--Pref.

Includes bibliographical references.

Approximate evaluation of a linear function at the vertices of the unit 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 _\infty norm;Lower performance bounds for on-line algorithms in the simple two-dimensional rectangle packing problems

There are no comments on this title.

to post a comment.