SWAT 1992: Algorithm Theory — SWAT '92 pp 338-339 | Cite as

New results on linear programming and related problems

• Authors
• Authors and affiliations

• Emo Welzl

Conference paper

First Online: 02 June 2005

• 112 Downloads

Part of the Lecture Notes in Computer Science book series (LNCS, volume 621)

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

References

1. [Cla]
   K. L. Clarkson, Las Vegas algorithms for linear and integer programming when the dimension is small, manuscript, 1989.Google Scholar
2. [Gär]
   B. Gärtner, A subexponential algorithm for abstract optimization problems, manuscript, 1992.Google Scholar
3. [Kal]
   G. Kalai, A subexponential randomized simplex algorithm, to appear in Proc. 24th ACM Symposium on Theory of Computing, 1992.Google Scholar
4. [MSW]
   J. Matoušek, M. Sharir, E. Welzl, A subexponential bound for linear programming, to appear in Proc. 8th Annual ACM Symposium on Computational Geometry, 1992.Google Scholar
5. [Shr]
   A. Schrijver, Theory of Linear and Integer Programming, John Wiley & Sons, 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

• Emo Welzl
  • 1

1. 1.Institut für InformatikFreie Universität BerlinBerlin 33Germany