Linear Optimization Queries

Journal of Algorithms

Volumn 14, Issue 3, 1993, Pages 432-448

  Matoušek, Jiří ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000166119     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1993.1023     Document Type: Article

References (27)

1. P. K. Agarwal and J. Matousek, Dynamic half-space range reporting and its applications, Tech. Report CS-1991-43, Duke University 1991; "Proceedings, 33rd IEEE Symposium on Foundations of Computer Science, 1992."
2. P. K. Agarwal and J. Matousek, Ray shooting and parametric search, in "Proceedings, 24th ACM Symposium on Theory of Computing, 1992, " pp. 517-526, also Tech. Report CS-1991-22, Duke University, 1991.
3. B. Ciiazelle and J. Friedman, A deterministic view of random sampling and its use in geometry, Combinatorial 10, No. 3 (1990), 229-249.
4. d) time, Inform. Process. Lett. 22, No. 1 (1986), 21-24.
5. K. Clarkson, Las Vegas algorithm for linear programming when the dimension is small, in "Proceedings, 29th IEEE Symposium on Foundations of Computer Science, 1988, " pp. 452-457.
6. K. L. Clarkson, Applications of random sampling in computational geometry II, in "Proceedings. 4th ACM Symposium on Computational Geometry, 1988, " pp. 1-11.
7. E. Cohen and N. Megiddo, Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs, in "Proceedings, 21st ACM Symposium on Theory of Computing, 1989, " pp. 523-534.
8. R. Cole, Slowing down sorting networks to obtain faster sorting algorithms, J. Assoc. Comput. Mach. 34 (1987), 200-208.
9. R. Cole, M. Sharir, and C. Yap. On Ar-hulls and related problems, SIAM J. Comput. 16, No. 1 (1987), 61-67.
10. E. M. Dyer, A. Frieze, and R. Kannan, A random polynomial time algorithm for approximating the volume of convex bodies, J. Assoc. Comput. Mach. 38 (1991), 1-17.
11. E. M. Dyer, On a multidimensional search technique and its application to the Euclidean 1-centre problem, SIAM J. Comput. 15 (1986), 725-738.
12. D. Eppstein, Dynamic three-dimensional linear programming, in "Proceedings, 32nd IEEE Symposium on Foundations of Computer Science. 1991, " pp. 94-103.
13. L. Guibas, J. Stolfi, and K. Clarkson, Solving related two-and three-dimensional linear programming in logarithmic time, Theoret. Comput. Sci. 49, No. 1 (1987), 81-84.
14. L. Lovasz. "An Algorithmic Theory of Numbers, Graphs and Convexity, " SIAM Regional Series in Applied Mathematics, SIAM, Philadelphia, 1986.
15. L. Lovasz and M. Simonovits, The mixing rate of Markov chains, an isoperi-metric inequality and computing the volume, in "Proceedings, 31st IEEE Symposium on Foundations of Computer Science, 1990, " pp. 346-355.
16. J. Matousek, Approximations and optimal geometric divide-and-conquer, in "Proceedings, 23rd ACM Symposium on Theory of Computing, 1991, " pp. 506-511.
17. J. Matousek, Reporting points in halfspaces, in "Proceedings, 32nd IEEE Symposium on Foundations of Computer Science, 1991, " pp. 207-215.
18. N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. Assoc. Comput. Mach. 30 (1983), 852-865.
19. N. Megiddo, Linear programming in linear time when the dimension is fixed, J. Assoc. Comput. Mach. 31 (1984), 114-127.
20. J. Matousek and O. Schwarzkopf, Linear optimization queries, in "Proceedings, 8th ACM Symposium on Computational Geometry, 1992, " pp. 16-25.
21. K. Mulmuley, Randomized multidimensional search trees: Lazy balancing and dynamic shuffling, in "Proceedings, 32nd IEEE Symposium on Foundations of Computer Science, 1991, " pp. 180-196.
22. C. H. Norton, S. A. Piotkin, and E. Tardos, Using separation algorithms in fixed dimension, in "Proceedings, 1st Annual ACM-SIAM Symposium on Discrete Algorithms, 1990, " pp. 377-378.
23. F. Preparata and M. I. Shamos, "Computational Geometry—An Introduction, " Springer-Verlag, New York/Berlin, 1985.
24. R. Seidel, Constructing higher-dimensional convex hulls at logarithmic cost per face, in "Proceedings, 18th ACM Symposium on Theory of Computing, 1986, " pp. 404-413.
25. R. Seidel, Small dimensional linear programming and convex hulls made easy. Discrete Comput. Geom. 6, No. 5 (1991), 423-434.
26. R. Seidel and E. Weizl, private communication, May 1990.
27. E. Welzl, Smallest Enclosing Disks, Balls and Ellipsoids, in "New Results and New Trends in Computer Science" (H. Maurer, Ed.), Lecture Notes in Computer Science 555, Springer-Verlag, New York/Berlin 1991, pp. 359-370.