Abstract
We introduce a fast parallel approximation algorithm for the positive linear programming optimization problem, i.e. the special case of the linear programming optimization problem where the input constraint matrix and constraint vector consist entirely of positive entries. The algorithm is elementary, and has a simple parallel implementation that runs in polylog time using a linear number of processors.
Cite
CITATION STYLE
Luby, M., & Nisan, N. (1993). A parallel approximation algorithm for positive linear programming. In Proceedings of the Annual ACM Symposium on Theory of Computing (Vol. Part F129585, pp. 448–457). Association for Computing Machinery. https://doi.org/10.1145/167088.167211
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
