Randomizing combinatorial algorithms for linear programming when the dimension is moderately high

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 101-108

  Pellegrini, M ^a  

^a CNR   (Italy)

Author keywords

Algorithms; Experimentation; Measurement; Performance; Reliability; Theory

Indexed keywords

EID: 64049098714     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Ilan Adler, Richard M. Karp, Ron Shamir, A simplex variant solving an m×d linear program in O(min(m2,d2)) expected number of pivot steps, Journal of Complexity, v.3 n.4, p.372-387, December 1, 1987 [doi〉10.1016/ 0885-064X(87)90007-0]
2. K.-H. Borgwardt. Some distribution-independent results about the asymptotic order of the average number of pivot steps of the simplex method. Mathematics of Operations Research, 7:441-462, 1982.
3. K.-H. Borgwardt. The Simplex Method. A Probabilistic Analysis, volume 1 of Algorithms and Combinatorics; Study and Research Texts. Springer-Verlag, Berlin, 1987.
4. V. Chandru and M. R. Rao. Linear programming. In M.J. AtaUah (Editor-in-Chief), Algorithms and Theory of Computation Handbook. CRC Press, 1999.
5. Bernard Chazelle, Jiří Matoušek, On linear-time deterministic algorithms for optimization problems in fixed dimension, Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, p.281-290, January 25-27, 1993, Austin, Texas, United States
6. V. Chvgtal. Linear Programming. W. H. Freeman and Company, New York, 1983.
7. Kenneth L. Clarkson, Las Vegas algorithms for linear and integer programming when the dimension is small, Journal of the ACM (JACM), v.42 n.2, p.488-499, March 1995 [doi〉10.1145/201019.201036]
8. G. B. Dantzig. Linear Programming and Extensions. Princeton Univ. Press, Princeton, N J, 1962.
9. B. Gartner. Randomized optimization by Simplex-type methods. PhD thesis, Institut für Informatik, Freie Universitat Berlin, 1995.
10. Bernd Gartner, A Subexponential Algorithm for Abstract Optimization Problems, SIAM Journal on Computing, v.24 n.5, p.1018-1035, Oct. 1995 [doi〉10.1137/S0097539793250287]
11. Bernd Gärtner, Exact arithmetic at low cost-a case study in linear programming, Computational Geometry: Theory and Applications, v.13 n.2, p.121-139, June 1999 [doi〉10.1016/S0925-7721(99)00012-7 ]
12. Bernd Gärtner, Fast and Robust Smallest Enclosing Balls, Proceedings of the 7th Annual European Symposium on Algorithms, p.325-338, July 16-18, 1999
13. Bernd Gärtner, Sven Schönherr, An efficient, exact, and generic quadratic programming solver for geometric optimization, Proceedings of the sixteenth annual symposium on Computational geometry, p.110-118, June 12-14, 2000, Clear Water Bay, Kowloon, Hong Kong [doi〉10.1145/336154.336191]
14. Bernd Gärtner, Emo Welzl, Linear Programming - Randomization and Abstract Frameworks, Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science, p.669-687, February 22-24, 1996
15. Bernd Gärtner, Emo Welzl, Random sampling in geometric optimization: new insights and applications, Proceedings of the sixteenth annual symposium on Computational geometry, p.91-99, June 12-14, 2000, Clear Water Bay, Kowloon, Hong Kong [doi〉10.1145/336154.336186]
16. Gil Kalai, A subexponential randomized simplex algorithm (extended abstract), Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.475-482, May 04-06, 1992, Victoria, British Columbia, Canada [doi〉10.1145/129712.129759]
17. J. Matousek, M. Sharir, and E. Welzl. A subexponential bound for linear programming. Algorithmica, 16(4/5):498-516, October/November 1996.
18. Nimrod Megiddo, Linear Programming in Linear Time When the Dimension Is Fixed, Journal of the ACM (JACM), v.31 n.1, p.114-127, Jan. 1984 [doi〉10.1145/2422.322418]
19. K. Mulmuley. Computational Geometry: An Introduction through Randomized Algorithms. Prentice-Hall, Englewood Cliffs, N J, 1994.
20. Alexandeer Schrijver, Theory of linear and integer programming, John Wiley & Sons, Inc., New York, NY, 1986
21. Raimund Seidel, Small-dimensional linear programming and convex hulls made easy, Discrete & Computational Geometry, v.6 n.5, p.423-434, 1991
22. Micha Sharir, Emo Welzl, A Combinatorial Bound for Linear Programming and Related Problems, Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science, p.569-579, February 13-15, 1992
23. E. Welzl. Smallest enclosing disks (balls and ellipsoids). In H. Maurer (Ed.), New Results and New Trends in Computer Science, LNCS 555. 1991.