Approximating the Solution to Mixed Packing and Covering LPs in Parallel O˜(epsilon^{-3}) Time

ICALP, pp. 52:1-52:14, 2016.

Cited by: 20|Bibtex|Views7
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com

Abstract:

study the problem of approximately solving positive linear programs (LPs). This class of LPs models a wide range of fundamental problems in combinatorial optimization and operations research, such as many resource allocation problems, solving non-negative linear systems, computing tomography, single/multi commodity flows on graphs, etc. ...More

Code:

Data:

Your rating :
0

 

Tags
Comments