Linear Programming with Two Variables per Inequality in Poly-Log Time (1990)
Cached
Download Links
- [theory.stanford.edu]
- [theory.stanford.edu]
- [theory.stanford.edu]
- [theory.stanford.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | SIAM J. Computing |
| Citations: | 5 - 3 self |
BibTeX
@ARTICLE{Lueker90linearprogramming,
author = {George S. Lueker and Nimrod Megiddo and Vijaya Ramachandran},
title = {Linear Programming with Two Variables per Inequality in Poly-Log Time},
journal = {SIAM J. Computing},
year = {1990},
volume = {19},
pages = {6}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The parallel time complexity of the linear programming problem with at most twovariables per inequality is discussed. Let m denote the number of variables and the number of inequalities, respectively,ina linear programming problem. We assume all inequalities are weak. We describe an O((log m+log n)-time parallel algorithm for deciding feasibility, under the concurrent-read-exclusive-write PRAM model. It requires mn O(logn) processors in the worst case, though we do not know whether this bound is tight. When the problem is feasible a solution can be computed within the same complexity.
