Packing LPs are Hard to Solve Accurately, Assuming Linear Equations are Hard
SODA '20: ACM-SIAM Symposium on Discrete Algorithms Salt Lake City Utah January, 2020, pp. 279-296, 2020.
We study the complexity of approximately solving packing linear programs. In the Real RAM model, it is known how to solve packing LPs with N non-zeros in time Õ(N/ϵ). We investigate whether the ϵ dependence in the running time can be improved. Our first main result relates the difficulty of this problem to hardness assumptions for solvin...More
Full Text (Upload PDF)
PPT (Upload PPT)