Fixed-dimensional parallel linear programming via relative ϵ-approximations

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 132-141

  Goodrich, Michael T ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL EFFICIENCY; COMPUTATIONAL GEOMETRY; LINEAR PROGRAMMING;

EREW PRAM; LINEAR WORKS; PARALLEL COMPUTATION MODEL; PARALLEL METHOD; PRAM MODELS; RANGE SPACES; SET APPROXIMATIONS;

APPROXIMATION ALGORITHMS;

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

References (63)

1. P. K. Agarwal. Geometric partitioning and its applications. In J. E. Goodman, R. Pollack, and W. Steiger, editors, Computational Geometry: Papers from the DIMACS special year. Amer. Math. Soc., 1991.
2. M. Ajtai and N. Megiddo. A deterministic poly (log log n)-time w-processor algorithm for linear programming in fixed dimension. In Proc. 24th Annu. ACM Sympos. Theory Comput, pages 327-338, 1992.
3. N. Alon and N. Megiddo. Parallel linear programming in fixed dimension almost surely in constant time. In Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci., pages 574-582, 1990.
4. N. Alon and J. Spencer. The probabilistic method. J. Wiley & Sons, 1993.
5. N. M. Amato, M. T. Goodrich, and E. A. Ramos. Parallel algorithms for higher-dimensional convex hulls. In Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci., pages 683-694, 1994.
6. N. M. Amato, M. T. Goodrich, and B. A. Ramos. Computing faces in segment and simplex arrangements. In Proc. 27th Annu. ACM Sympos. Theory Comput., pages 672-682, 1995.
7. P. Assouad. Densité et dimension. Ann. Inst. Fourier, Grenoble, 3:232-282, 1983.
8. P. Beame and J. Hastad. Optimal bounds for decision problems on the CRCW PRAM. Journal of the ACM, 36(3):643-670, 1989.
9. K. P. Bennett. Decision tree construction via linear programming. In Proceedings of the 4th Midwest Artificial Intelligence and Cognitive Science Society Conference, pages 97-101, 1992.
10. K.P. Bennett and O.L. Mangasarian. Multicategory discrimination via linear programming. Optimization Methods and Software, 3:29-39, 1994.
11. B. Berger, J. Rompel, and P. W. Shor. Efficient NC algorithms for set cover with applications to learning and geometry. In Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci., Volume 30, pages 54-59, 1989.
12. H. Brönnimann and M. T. Goodrich. Almost optimal set covers in finite vc-dimension. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 293-302, 1994.
13. Hervé Brönnimann, Bernard Chazelle, and Jiří Matoušek. Product range spaces, sensitive sampling, and derandomization. In Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci. (FOCS 93), pages 400-409, 1993.
14. B. Chazelle and J. Friedman. A deterministic view of random sampling and its use in geometry. Combinatorica, 10(3):229-249, 1990.
15. B. Chazelle and J. Matousek. On linear-time deterministic algorithms for optimization problems in fixed dimension. In Proc. 4th ACM-SIAM Sympos. Discrete Algorithms, pages 281-290, 1993.
16. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of the observations. Annals of Math. Stat, 23:493-509, 1952.
17. V. Chvátal. Linear Programming. W. H. Freeman, New York, NY, 1983.
18. d2) time. Inform. Process. Lett., 22:21-24, 1986.
19. K. L. Clarkson. New applications of random sampling in computational geometry. Discrete Comput. Geom., 2:195-222, 1987.
20. K. L. Clarkson. A Las Vegas algorithm for linear programming when the dimension is small. In Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci., pages 452-456, 1988.
21. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.
22. G. B. Dantzig. Linear Programming and Extensions. Princeton University Press, Princeton, NJ, 1963.
23. X. Deng. An optimal parallel algorithm for linear programming in the plane. Inform. Process. Lett., 35:213-217, 1990.
24. M. Dyer. A parallel algorithm for linear programming in fixed dimension. In Proc. 11th ACM Symp. on Computational Geometry, 1995.
25. M. E. Dyer. Linear time algorithms for two- and three-variable linear programs. SIAM J. Comput., 13:31-45, 1984.
26. M. E. Dyer. On a multidimensional search technique and its application to the Euclidean one-center problem. SIAM J. Comput., 15:725-738, 1986.
27. H. Edelsbrunner. Algorithms in Combinatorial Geometry, Volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, West Germany, 1987.
28. D. Eppstein. Dynamic three-dimensional linear programming. ORSA J. Comput., 4:360-368, 1992.
29. T. Goldberg and U. Zwick. Optimal deterministic approximate parallel prefix sums and their applications. In Proc. 4th IEEE Israel Symp. on Theory of Computing and Systems, pages 220-228, 1995.
30. M. T. Goodrich. Geometric partitioning made easier, even in parallel. In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 73-82, 1993.
31. M. T. Goodrich, Y. Matias, and U. Vishkin. Optimal parallel approximation for prefix sums and integer sorting. In Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, pages 241-250, 1994.
32. T. Hagerup. Fast deterministic processor allocation. In 4th ACM-SIAM Symposium on Discrete Algorithms, pages 1-10, 1993.
33. T. Hagerup and C. Rüb. A guided tour of Chernoff bounds. Information Processing Letters, 33(10):305-308, 1990.
34. D. Haussler and E. Welzl. Epsilon-nets and simplex range queries. Discrete Comput. Geom., 2:127-151, 1987.
35. J. Jájá. An Introduction to Parallel Algorithms. Addison-Wesley, Reading, Mass., 1992.
36. G. Kalai. A subexponential randomized simplex algorithm. In Proc. 24th Annu. ACM Sympos. Theory Comput., pages 475-482, 1992.
37. H. Karloff. Linear Programming. Birkhauser, Boston, 1991.
38. H. Karloff and Y. Mansour. On construction of k-wise independent random variables. In Proc. ACM Sympos. Theory of Computing, pages 564-573, 1994.
39. R. M. Karp and V. Ramachandran. Parallel algorithms for shared memory machines. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 869-941. Elsevier/The MIT Press, Amsterdam, 1990.
40. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput., 15(4):1036-1053, 1986.
41. M. Luby. Removing randomness in parallel computation without a processor penalty. In Proc. 29th IEEE Symp. on Found. Comp. Sci., pages 162-173, 1988.
42. Y. Matias and U. Vishkin. Converting high probability into nearly-constant time-with applications to parallel hashing. In 23rd A CM Symp. on Theory of Computing, pages 307-316, 1991.
43. J. Matousek. Approximations and optimal geometric divide-and-conquer. In Proc. 23rd Annu. ACM Sympos. Theory Comput., pages 505-511, 1991. Also to appear in J. Comput. Syst. Sci.
44. J. Matousek. Cutting hyperplane arrangements. Discrete Comput. Geom., 6:385-406, 1991.
45. J. Matousek. Epsilon-nets and computational geometry. In J. Pach, editor, New Trends in Discrete and Computational Geometry, Volume 10 of Algorithms and Combinatorics, pages 69-89. Springer-Verlag, 1993.
46. J. Matoušek, M. Sharir, and E. Welzl. A subexponential bound for linear programming. In Proc. 8th Annu. ACM Sympos. Comput. Geom., pages 1-8, 1992.
47. J. Matoušek, E. Welzl, and L. Wernisch. Discrepancy and ϵ-approximations for bounded VC-dimension. Combinatorica, 13:455-466, 1993.
48. J. Matousek. Efficient partition trees. Discrete Comput. Geom., 8:315-334, 1992.
49. J. Matousek. Linear optimization queries. J. Algorithms, 14:432-448, 1993. The results combined with results of O. Schwarzkopf also appear in Proc. 8th ACM Sympos. Comput. Geom., 1992, pages 16-25.
50. 3 and related problems. SIAM J. Comput., 12:759-776, 1983.
51. N. Megiddo. Linear programming in linear time when the dimension is fixed. J. ACM, 31:114-127, 1984.
52. R. Motwani, J. Naor, and M. Naor. The probabilistic method yields deterministic parallel algorithms. In Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci., pages 8-13, 1989.
53. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York, 1995.
54. C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, Englewood Cliffs, NJ, 1982.
55. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985.
56. J. H. Reif. Synthesis of Parallel Algorithms. Morgan Kaufmann Publishers, Inc., San Mateo, CA, 1993.
57. J. T. Rompel. Techniques for Computing with Low-Independence Randomness. Ph.D. thesis, Dept. of EECS, M.I.T., 1990.
58. N. Sauer. On the density of families of sets. Journal of Combinatorial Theory, 13:145-147, 1972.
59. J. P. Schmidt, A. Siegel, and A. Srinivasan. Chernoff-Hoeffding bounds for applications with limited independence. In Proc. 4th ACM-SIAM Symp. on Discrete Algorithms, pages 331-340, 1993.
60. R. Seidel. Small-dimensional linear programming and convex hulls made easy. Discrete Comput. Geom., 6:423-434, 1991.
61. S. Sen. A deterministic poly(log log n) time optimal CRCW PRAM algorithm for linear programming in fixed dimension. Technical Report 95-08, Dept. of Computer Science, University of Newcastle, 1995.
62. L. Valiant. Parallelism in comparison problems. SIAM J. Comput., 4(3):348-355, 1975.
63. V. N. Vapnik and A. Y. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl., 16:264-280, 1971.