A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Nearly-Linear Time Positive LP Solver with Faster Convergence Rate
2015
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing - STOC '15
Positive linear programs (LP), also known as packing and covering linear programs, are an important class of problems that bridges computer science, operation research, and optimization. Efficient algorithms for solving such LPs have received significant attention in the past 20 years [LN93, PST95, BBR97, You01, Nem04, BI04, BBR04, Nes05, CE05, AK08, Nes08, AHK12, KY13, You14, AO15]. Unfortunately, all known nearly-linear time algorithms for producing (1 + ε)-approximate solutions to positive
doi:10.1145/2746539.2746573
dblp:conf/stoc/ZhuO15
fatcat:vveqgjdginc5lom6hu4ngjjqye