Discrete Analysis and Operations Research

by Alekseii D. Korshunov (Editor)

Overview

The contributions to this volume have all been translated from the first 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 1994.
The papers collected here give an excellent overview of recent Russian research in topics such as analysis of algorithms, combinatorics, graphs, lower bounds for complexity of Boolean functions, packing and coverings, scheduling theory, search and sorting, linear programming, and testing.
Audience: This book will be of interest to specialists in discrete mathematics and computer science, and engineers.

Product Details

ISBN-13:	9789401072175
Publisher:	Springer Netherlands
Publication date:	09/28/2011
Series:	Mathematics and Its Applications , #355
Edition description:	Softcover reprint of the original 1st ed. 1996
Pages:	344
Product dimensions:	6.30(w) x 9.45(h) x 0.03(d)

Table of Contents

The Number of Distinct Subwords of Fixed Length in the Morse-Hedlund Sequence.- Locally Isometric Embeddings of Graphs and the Metric Prolongation Property.- Local Complementations of Simple and Directed Graphs.- An Approximation Algorithm for the Traveling Salesman Problem and Its Probabilistic Analysis.- On Minimum Independent Dominating Sets in Graphs.- Regular Partitions and Cuts in Integer Programming.- Complexity of Coverings of Number Sets by Arithmetical Progressions.- Circuit Realization of the Sorting Problem.- A Refinement of the Frank-Seb?-Tardos Theorem and Its Applications.- On the Length of the Chinese Postman Tour in Regular Graphs.- An Integer Linear Programming Algorithm Polynomial in the Average Case.- Projections of the Hypercube on the Line and the Plane.- Canonical Decomposition of Graphs.- Fault Detection in Parts of the Circuits of Functional Elements.- On the External Stability Number of the Generalized De Bruijn Graphs.- On the Lower Bounds for the Complexity of Serial-Parallel Contact Circuits Realizing Linear Boolean Functions.- Efficient Scheduling in Open Shops.- Nonstrict Vector Summation in Scheduling Problems.- Worst-Case Analysis of Some Algorithms for Solving the Subset-Sum Problem.- On the Depth of Conditional Tests for Controlling “Negation” Type Faults in Circuits of Functional Gates.- Synthesis of Transitive Order Relations Compatible with the Power of Criteria.