Overview

The contributions to this volume have all been translated from the second volume of the Russian journal ""Discrete Analysis and Operational Research"", published at the Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia, in 1995. The papers collected here give an overview of recent Russian research in such topics as analysis of algorithms, combinatorics, coding theory, graphs, and lower bounds for complexity of Boolean functions and scheduling theory. They can be seen as an update of the book ""Discrete Analysis and Operational Research"", published by Kluwer in 1996.

Full Product Details

Author:   Alekseii D. Korshunov
Publisher:   Springer
Imprint:   Springer
Edition:   1997 ed.
Volume:   391
Dimensions:   Width: 17.00cm , Height: 2.00cm , Length: 24.40cm
Weight:   1.470kg
ISBN:  

9780792343349

ISBN 10:   0792343344
Pages:   336
Publication Date:   31 December 1996
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print  
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

On Discrete Approximations of Continuous Functions with Bounded Second Derivative.- On a Property of Perfect Binary Codes.- Edge Neighborhoods in Normal Maps.- An Upper Bound for the Length of a Snake in the n-Dimensional Unit Cube.- Operations and Isometric Embeddings of Graphs Related to the Metric Prolongation Property.- Effective Algorithms for Solving Multi-Level Plant Location Problem.- On the Complexity of Realization of Boolean Functions by Circuits over an Infinite Basis.- Dynamic Problems of Choosing Optimal Composition of a System of Technical Tools.- Lower Bounds in the Problem of Choosing an Optimal Composition of a Two-Level System of Technical Tools.- On Schedules of a Single Machine Jobs with Processing Times Nonlinear in Time.- Problems of Reconstructing Words from Their Fragments and Applications.- A Vertex Variant of the Kleitman-West Problem.- Regular Graphs Whose Every Edge Belongs to Many Triangles.- On Closed Classes in k-Valued Logic Which Contain a Homogeneous Switching function.- Strongly Essential Variables of the Functions of k- Valued Logic.- On Comparison Between the Sizes of Read-k-Times Branching Programs.- Some Optimization Problems of Scheduling the Transmission of Messages in a Local Communication Network.- The Maximum-Weight Traveling Salesman Problem in Finite-Dimensional Real Spaces.- Nonstrict Vector Summation in the Plane and Its Applications to Scheduling Problems.- Bounds for Approximate Solution of a Scheduling Problem.- On Certain Bounds for the Weight of l-Balanced Boolean Functions.- Spectral Properties of Perfect Binary (n,Z)-Codes.- Distributive Coloring of Graph Vertices.- Deciphering Threshold Functions of k- Valued Logic.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions