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.
|Original language||American English|
|Title of host publication||Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993|
|Publisher||Association for Computing Machinery|
|Number of pages||10|
|State||Published - 1 Jun 1993|
|Event||25th Annual ACM Symposium on Theory of Computing, STOC 1993 - San Diego, United States|
Duration: 16 May 1993 → 18 May 1993
|Name||Proceedings of the Annual ACM Symposium on Theory of Computing|
|Conference||25th Annual ACM Symposium on Theory of Computing, STOC 1993|
|Period||16/05/93 → 18/05/93|
Bibliographical noteFunding Information:
*International Computer Science Institute and UC Berkeley. Research supported in part by NSF Grant CCR-9016468 and grant No. 89-00312 from the United States-Israel Binational Science Foundation (BSF), Jerusalem, Israel. tHebrew University, Jerusalem, Israel. Supported by USA-Israel BSF 89-00126 and by a Wolfson research award. Research partially done while visiting the International Computer Science Institute.
© 1993 ACM.