Cantitate/Preț
Produs

Discrete Analysis and Operations Research: Mathematics and Its Applications, cartea 355

Editat de Alekseii D. Korshunov
en Limba Engleză Hardback – 30 noi 1995

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 53053 lei  39-44 zile
  SPRINGER NETHERLANDS – 28 sep 2011 53053 lei  39-44 zile
Hardback (1) 54054 lei  39-44 zile
  SPRINGER NETHERLANDS – 30 noi 1995 54054 lei  39-44 zile

Din seria Mathematics and Its Applications

Preț: 54054 lei

Preț vechi: 67568 lei
-20%

Puncte Express: 811

Preț estimativ în valută:
10356 11243$ 8881£

Carte tipărită la comandă

Livrare economică 06-11 mai

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780792338666
ISBN-10: 0792338669
Pagini: 356
Ilustrații: VIII, 344 p.
Dimensiuni: 156 x 234 x 25 mm
Greutate: 0.67 kg
Ediția:1996
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Mathematics and Its Applications

Locul publicării:Dordrecht, Netherlands

Public țintă

Research

Cuprins

Preface. The Number of Distinct Subwords of Fixed Length in the Morse-Hedlund Sequence; S.V. Avgustinovich. Locally Isometric Embeddings of Graphs and the Metric Prolongation Property; A.A. Evdokimov. Local Complementations of Simple and Directed Graphs; D.G. Fon-Der-Flaass. An Approximation Algorithm for the Travelling Salesman Problem and Its Probabilistic Analysis; È.Kh. Gimadi, et al. On Minimum Independent Dominating Sets in Graphs; N.I. Glebov, A.V. Kostochka. Regular Partitions and Cuts in Integer Programming; A.A. Kolokolov. Complexity of Coverings of Number Sets by Arithmetical Progressions; A.D. Korshunov. Circuit Realization of the Sorting Problem; È.Sh. Kospanov. A Refinement of the Frank-Sebö-Tardos Theorem and Its Applications; A.V. Kostochka. On the Length of the Chinese Postman Tour in Regular Graphs; A.V. Kostochka, N. Tulai. An Integer Linear Programming Algorithm Polynomial in the Average Case; N.N. Kuzyurin. Projections of the Hypercube on the Line and the Plane; A.A. Levin. Canonical Decomposition of Graphs; V.V. Lozin. Fault Detection in Parts of the Circuits of Functional Element; V.N. Noskov. On the External Stability Number of the Generalized De Bruijn Graphs; V. Nyu. On the Lower Bounds for the Complexity of Serial-Parallel Contact Circuits Realizing Linear Boolean Functions; K.L. Rychkov. Efficient Scheduling in Open Shops; S.V. Sevast'yanov. Nonstrict Vector Summation in Scheduling Problems; S.V. Sevast'yanov. Worst-Case Analysis of Some Algorithms for Solving the Subset-Sum Problem; Yu.V. Shamardin. On the Depth of Conditional Tests for Controlling `Negation' Type Faults in Circuits of Functional Gates; V.I. Shevchenko. Synthesis of Transitive Order Relations Compatible with the Power ofCriteria; L.A. Sholomov. Index.