Faster width-dependent algorithm for mixed packing and covering LPs

Digvijay P Boob
Digvijay P Boob

ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), pp. 15253-15262, 2019.

Cited by: 2|Bibtex|Views7
EI
Other Links: academic.microsoft.com|dblp.uni-trier.de|arxiv.org
Keywords:
combinatorial optimisationoperations researchcombinatorial optimizationcomputer science

Abstract:

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

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments