Packing LPs are Hard to Solve Accurately, Assuming Linear Equations are Hard

Peng Zhang
Peng Zhang

SODA '20: ACM-SIAM Symposium on Discrete Algorithms Salt Lake City Utah January, 2020, pp. 279-296, 2020.

Cited by: 1|Bibtex|Views2|
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|dl.acm.org

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments