A parallel algorithm for linear programming in fixed dimension

Proceedings of the Annual Symposium on Computational Geometry

Volumn Part F129372, Issue , 1995, Pages 345-349

  Dyer, Martin ^a  

^a UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; PARALLEL ALGORITHMS;

EREW PRAM;

LINEAR PROGRAMMING;

EID: 0010797831     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/220279.220316     Document Type: Conference Paper

References (14)

1. M. Ajtai, J. Komlos, W. Steiger and E. Szemeredi, Deterministic selection in O (log log n) time, Proc. 18th Ann. Symp. on Theory of Computing (1986), 188-195.
2. M. Ajtai and N. Megiddo, A deterministic poly (log log n)-time n-processor algorithm for linear programming in fixed dimension, Proc. 24th Ann. Symp. on Theory of Computing (1992), 327-338.
3. N. Alon and N. Megiddo, Parallel linear programming almost surely in constant time, Proc. 31st IEEE Symp. on Foundations of Computer Science (1990), 574-582.
4. P. Beame and J. Hastad, Optimal bounds for decision problems on the CRCW PRAM, Proc. 19th Ann. Symp. on Theory of Computing (1987), 83-93.
5. B. Chazelle and J. Matousek, On linear-time deterministic algorithms for optimization problems in fixed dimension, Proc. 4th ACM-SIAMSymp. on Discrete Algorithms (1993), 281-290.
6. K. Clarkson, A Las Vegas algorithm for linear programming when the dimension is small, Proc. 29st IEEE Symp. on Foundations of Computer Science (1988), 452-456.
7. d2) time, Information Processing Letters 22(1986), 21-27.
8. R. Cole, Parallel merge sort, SIAM J. on Computing 17(1988), 770-785.
9. X. Deng, An optimal parallel algorithm for linear programming in the plane, Information Processing Letters 35(1990), 213-217.
10. M. Dyer, On a multidimensional search problem and its application to the Euclidean one-centre problem, SIAM J. on Computing 15(1986), 725-738.
11. M. Goodrich, Geometric partitioning made easier, even in parallel, Proc. 9th ACM Symp. on Computational Geometry (1993), 73-82.
12. R. Karp and V. Ramachandran, Parallel algorithms for shared-memory machines, in Handbook of Theoretical Computer Science Vol. A: Algorithms and Complexity, Ed. J. van Leeuwen, Elsevier, Amsterdam, 1990, pp. 869-941.
13. N. Megiddo, Linear programming in linear time when the dimension is fixed, J. of the ACM 31(1984), 114-127.
14. L. Valiant, Parallelism in comparison problems, SIAM J. on Computing 4(1975), 348-355.