A randomized algorithm for fixed-dimensional linear programming
- 1 May 1989
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 44 (1) , 203-212
- https://doi.org/10.1007/bf01587088
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- New applications of random sampling in computational geometryDiscrete & Computational Geometry, 1987
- ɛ-nets and simplex range queriesDiscrete & Computational Geometry, 1987
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre ProblemSIAM Journal on Computing, 1986
- Linear programming in O(n × 3d) timeInformation Processing Letters, 1986
- Linear Time Algorithms for Two- and Three-Variable Linear ProgramsSIAM Journal on Computing, 1984
- Linear Programming in Linear Time When the Dimension Is FixedJournal of the ACM, 1984
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related ProblemsSIAM Journal on Computing, 1983
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963