2000 character limit reached
A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs (0801.1987v2)
Published 13 Jan 2008 in cs.DS
Abstract: We give an approximation algorithm for 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 computes feasible primal and dual solutions whose costs are within a factor of 1+eps of the optimal cost in time O((r+c)log(n)/eps2 + n).