Parallel Multidimensional Search Using Approximation Algorithms: With Applications to Linear-Programming and Related Problems

@inproceedings{Sen1996ParallelMS,
  title={Parallel Multidimensional Search Using Approximation Algorithms: With Applications to Linear-Programming and Related Problems},
  author={Sandeep Sen},
  booktitle={SPAA},
  year={1996}
}
We describe a very simple deterministic parallel algorithm for linear programming in fixed dimension d that takes poly(log log n) time in the common CRCW PRAM model and does optimal O(n) work. Our algorithm is based on multidimensional search and an effective use of approximation algorithms to speed-up the basic search in the CRCW model. Our method also yields very fast poly(log log n) algorithm for smallest enclosing sphere and approximate ham-sandwich cuts as well as an O (log n) time work… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-4 of 4 extracted citations

Similar Papers

Loading similar papers…