This is a preview of subscription content, log in via an institution to check access.
References
K. L. Clarkson, Las Vegas algorithms for linear and integer programming when the dimension is small, manuscript, 1989.
B. Gärtner, A subexponential algorithm for abstract optimization problems, manuscript, 1992.
G. Kalai, A subexponential randomized simplex algorithm, to appear in Proc. 24th ACM Symposium on Theory of Computing, 1992.
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.
A. Schrijver, Theory of Linear and Integer Programming, John Wiley & Sons, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Welzl, E. (1992). New results on linear programming and related problems. In: Nurmi, O., Ukkonen, E. (eds) Algorithm Theory — SWAT '92. SWAT 1992. Lecture Notes in Computer Science, vol 621. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55706-7_30
Download citation
DOI: https://doi.org/10.1007/3-540-55706-7_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55706-7
Online ISBN: 978-3-540-47275-9
eBook Packages: Springer Book Archive