Faster Parallel Solver for Positive Linear Programs via Dynamically-Bucketed Selective Coordinate Descent

arXiv: Data Structures and Algorithms, Volume abs/1511.06468, 2015.

Cited by: 10|Bibtex|Views7
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org

Abstract:

We provide improved parallel approximation algorithms for the important class of packing and covering linear programs. In particular, we present new parallel $epsilon$-approximate packing and covering solvers which run in $tilde{O}(1/epsilon^2)$ expected time, i.e., in expectation they take $tilde{O}(1/epsilon^2)$ iterations and they do $...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments