Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel
Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel
Previous chapter Next chapter Full AccessProceedings Proceedings of the 2015 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in ParallelZeyuan Allen-Zhu and Lorenzo OrecchiaZeyuan Allen-Zhu and Lorenzo Orecchiapp.1439 - 1456Chapter DOI:https://doi.org/10.1137/1.9781611973730.95PDFBibTexSections ToolsAdd to favoritesExport …