Skip to main content
SpringerLink
Log in
Book cover

Discrete Analysis and Operations Research

  • Book
  • © 1996

Overview

Editors:
  1. Alekseǐ D. Korshunov

    1. Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Siberia, Russia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Mathematics and Its Applications (MAIA, volume 355)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (21 chapters)

  1. Front Matter

    Pages i-vii
    Download chapter PDF

  2. The Number of Distinct Subwords of Fixed Length in the Morse-Hedlund Sequence

    • S. V. Avgustinovich
    Pages 1-5

  3. Locally Isometric Embeddings of Graphs and the Metric Prolongation Property

    • A. A. Evdokimov
    Pages 7-14

  4. Local Complementations of Simple and Directed Graphs

    • D. G. Fon-Der-Flaass
    Pages 15-34

  5. An Approximation Algorithm for the Traveling Salesman Problem and Its Probabilistic Analysis

    • È. Kh. Gimadi, N. I. Glebov, A. I. Serdyukov
    Pages 35-43

  6. On Minimum Independent Dominating Sets in Graphs

    • N. I. Glebov, A. V. Kostochka
    Pages 45-58

  7. Regular Partitions and Cuts in Integer Programming

    • A. A. Kolokolov
    Pages 59-79

  8. Complexity of Coverings of Number Sets by Arithmetical Progressions

    • A. D. Korshunov
    Pages 81-100

  9. Circuit Realization of the Sorting Problem

    • È. Sh. Kospanov
    Pages 101-108

  10. A Refinement of the Frank-Sebő-Tardos Theorem and Its Applications

    • A. V. Kostochka
    Pages 109-123

  11. On the Length of the Chinese Postman Tour in Regular Graphs

    • A. V. Kostochka, N. Tulai
    Pages 125-141

  12. An Integer Linear Programming Algorithm Polynomial in the Average Case

    • N. N. Kuzyurin
    Pages 143-152

  13. Projections of the Hypercube on the Line and the Plane

    • A. A. Levin
    Pages 153-162

  14. Canonical Decomposition of Graphs

    • V. V. Lozin
    Pages 163-172

  15. Fault Detection in Parts of the Circuits of Functional Elements

    • V. N. Noskov
    Pages 173-209

  16. On the External Stability Number of the Generalized De Bruijn Graphs

    • V. Nyu
    Pages 211-216

  17. On the Lower Bounds for the Complexity of Serial-Parallel Contact Circuits Realizing Linear Boolean Functions

    • K. L. Rychkov
    Pages 217-234

  18. Efficient Scheduling in Open Shops

    • S. V. Sevast’yanov
    Pages 235-255

  19. Nonstrict Vector Summation in Scheduling Problems

    • S. V. Sevast’yanov
    Pages 257-287

  20. Worst-Case Analysis of Some Algorithms for Solving the Subset-Sum Problem

    • Yu. V. Shamardin
    Pages 289-299
Back to top

Keywords

Editors and Affiliations

  • Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Siberia, Russia

    Alekseǐ D. Korshunov

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation