A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs
Data Structures and Algorithms
2015-06-02 v2
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)/eps^2 + n).
Cite
@article{arxiv.0801.1987,
title = {A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs},
author = {Christos Koufogiannakis and Neal E. Young},
journal= {arXiv preprint arXiv:0801.1987},
year = {2015}
}
Comments
corrected version of FOCS 2007 paper: 10.1109/FOCS.2007.62. Accepted to Algorithmica, 2013