A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs
- Author(s): Koufogiannakis, C
- Young, NE
- et al.
Published Web Locationhttps://doi.org/10.1007/s00453-013-9771-6
We give an approximation algorithm for fractional packing and covering linear programs (linear programs with non-negative coefficients). Given a constraint matrix with n non-zeros, r rows, and c columns, the algorithm (with high probability) computes feasible primal and dual solutions whose costs are within a factor of 1+ε of opt (the optimal cost) in time O((r+c)log(n)/ε2+n).