Faster width-dependent algorithm for mixed packing and covering LPs
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), pp. 15253-15262, 2019.
combinatorial optimisationoperations researchcombinatorial optimizationcomputer science
In this paper, we give a faster width-dependent algorithm for mixed packing covering LPs. Mixed packing-covering LPs are fundamental to combinatorial optimization in computer science and operations research. Our algorithm finds a 1 + epsilon approximate solution in time O(Nw/epsilon) where N is number of nonzero entries in the constraint ...More
PPT (Upload PPT)