Exact arithmetic at low cost - A case study in linear programming

Computational Geometry: Theory and Applications

Volumn 13, Issue 2, 1999, Pages 121-139

  Gärtner, Bernd ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Exact arithmetic Lp type problems; Linear programming; Simplex method

Indexed keywords

EID: 18144438145     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(99)00012-7     Document Type: Article

References (21)

1. I. Adler, R. Shamir, A randomized scheme for speeding up algorithms for linear and convex programming with high constraints-to-variable ratio, Math. Programming 61 (1993) 39-52.
2. D. Avis, A C implementation of the reverse search vertex enumeration algorithm, URL: ftp:// mutt.cs.mcgill. ca/pub/C/.
3. D. Avis, K. Fukuda, A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, Discrete Comput. Geom. 8 (1992) 295-313.
4. R.E. Bixby, J.W. Gregory, I.J. Lustig, R.E. Marsten, D.F. Shanno, Very large-scale linear programming: a case study in combining interior point and simplex methods, Oper. Res. 40 (5) (1992) 885-897.
5. H. Brönnimann, C. Burnikel, S. Pion, Interval arithmetic yields efficient arithmetic filters for computational geometry, Manuscript, 1997.
6. H. Brönnimann, I.Z. Emiris, V.Y. Pan, S. Pion, Computing exact geometric predicates using modular arithmetic with single precision, in: Proc. 13th Annu. ACM Sympos. Comput. Geom., 1997, pp. 174-182.
7. V. Chvátal, Linear Programming, W.H. Freeman, New York, NY, 1983.
8. K.L. Clarkson, A Las Vegas algorithm for linear programming when the dimension is small, J. ACM 42 (2) (1995) 488-499.
9. G.B. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1963.
10. J. Edmonds, J.-F. Maurras, Note sur les Q-matrices d'Edmonds, Rech. Opér. (RAIRO) 31 (2) (1997) 203-209.
11. G. Forsythe, C. Moler, Computer Solutions of Linear Algebra Systems, Prentice-Hall, Englewood Cliffs, NJ, 1967.
12. S. Fortune, C.J. Van Wyk, Efficient exact arithmetic for computational geometry, in: Proc. 9th Annu. ACM Sympos. Comput. Geom., 1993, pp. 163-172.
13. K. Fukuda, cdd+ reference manual, URL: http:// www.ifor.math.ethz.ch/ifor/staff/fukuda/cddplus_man/ cddman.html.
14. J. García-López, P. Ramos, Fitting a set of points by a circle, in: Proc. 13th Annu. ACM Sympos. Comput. Geom., 1997, pp. 139-146.
15. B. Gärtner, E. Welzl, An analysis of Clarkson's sampling lemma, Manuscript, 1997.
16. A. Löbel, T. Christof, Porta - polyhedron representation transformation algorithm, URL: http://www.zib.de/ Optimization/Software/Porta/.
17. J. Matoušek, M. Sharir, E. Welzl, A subexponential bound for linear programming, Algorithmica 16 (1996) 498-516.
18. K. Mehlhorn, S. Näher, LEDA, a library of efficient data types and algorithms, Report A 04/89, Fachber. Inform., Univ. Saarlandes, Saarbrücken, Germany, 1989.
19. K. Mehlhorn, S. Näher, LEDA: a platform for combinatorial and geometric computing, Commun. ACM 38 (1995) 96-102.
20. K. Mehlhorn, T. Shermer, C. Yap, A complete roundness classification procedure, in: Proc. 13th Annu. ACM Sympos. Comput. Geom., 1997, pp. 129-138.
21. P. Wolfe, The simplex method for quadratic programming, Econometrica 27 (1959) 382-398.