ESA 1997: Algorithms — ESA '97 pp 443-458 | Cite as

Seven problems: So different yet close

  • Sergey Sevastianov
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1284)

Abstract

We show that seven discrete optimization problems from different fields of discrete mathematics (such as linear algebra, combinatorics, ] geometry, and functional analysis) that at first sight seem to be quite different prove to be in fact rather close to each other. This closeness enables us, given an algorithm for one problem, to construct an optimization or approximation algorithm for solving the other problems in the list. For each problem, an extremum function is defined which characterizes the performance of the optimal solution of the problem in the worst case. Relations between these extremum functions are derived.

Keywords

Discrete Mathematic Extremum Function Finite Family Discrete Optimization Problem Hadamard Matrice 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alon N., Spencer, J., Erdös, P.: The probabilistic method. A Willey-Interscience Publication (1992), 254 p.Google Scholar
  2. 2.
    Banaszczyk, W.: The Steinitz constant of the plane. J.Reine and Angew.Math.373 (1987) 218–220Google Scholar
  3. 3.
    Banaszczyk, W.: A note on the Steinitz constant of the Euclidean plane. C.R. Math. Rep. Acad. Sci. Canada 12 (1990), no. 4, 97–102.Google Scholar
  4. 4.
    Beck, J., Fiala, T.: “Integer-making” theorems. Discrete Appl. Math. 3 (1981) 1–8Google Scholar
  5. 5.
    Behrend, F. A.: The Steinitz-Gross theorem on sums of vectors. Can. J. Math. 6 (1954) 108–124Google Scholar
  6. 6.
    Dvoretzky, A.: Problem. In: Proceedings of Symposia in Pure Mathematics, Vol.7 Convexity, Amer. Math. Soc., Providence, RI, (1963) p.496Google Scholar
  7. 7.
    Gross, W.: Bedingt Konvergente Reihen. Monatsh. Math. and Physik. 28 (1917) 221–237Google Scholar
  8. 8.
    Olson, J., Spencer, J.: Balancing families of sets. J. Comb. Theory (Ser. A) 25 (1978) 29–37Google Scholar
  9. 9.
    Sevastianov, S. V.: Asymptotical approach to some scheduling problems. (In Russian) Upravlyaemye Sistemy 14 (1975) 40–51Google Scholar
  10. 10.
    Sevastianov, S. V.: Approximate solution of some problems of scheduling theory. (In Russian) Metody Diskret. Analiz. 32 (1978) 66–75Google Scholar
  11. 11.
    Sevastianov, S. V.: On a connection between calendar-planning problem and one problem on the unit cube. (In Russian) Metody Diskret. Analiz. 35 (1980) 93–103Google Scholar
  12. 12.
    Sevastianov, S. V.: Approximate solution to a calendar-planning problem. (In Russian) Upravlyaemye Sistemy 20 (1980) 49–63Google Scholar
  13. 13.
    Sevastianov, S. V.: Approximation algorithms for Johnson's and vector summation problems. (In Russian) Upravlyaemye Sistemy 20 (1980) 64–73Google Scholar
  14. 14.
    Sevastianov, S. V.: Geometry in scheduling theory. (In Russian) In: Models and Methods of Optimization, Trudy Inst. Mat. 10 (Novosibirsk, 1988) 226–261Google Scholar
  15. 15.
    Steinitz, E.: Bedingt Konvergente Reihen und Convexe Systeme. J. Reine and Angew. Math. 143 (1913) 128–175Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Sergey Sevastianov
    • 1
  1. 1.Institute of MathematicsUniversitetskii pr. 4Novosibirsk-90Russia

Personalised recommendations