Add to ORKGPacking and covering linear programs (LP) are an important class of problems that bridges computer science, operation research, and optimization. Efficient algorithms for solving such LPs have received significant attention in the past 20 years [LN93, PST95, BBR97, You01
We consider a class of linear programs involving a set of covering constraints of which at most k ar...
We consider a class of linear programs involving a set of covering constraints of which at most k ar...
We obtain faster algorithms for problems such as r-dimensional matching and r-set packing when the s...
Packing and covering linear programs (PC-LP s) form an important class of linear programs (LPs) acro...
Positive linear programs (LPs), or equivalently, mixed packing and covering LPs, are LPs formulated ...
We give an approximation algorithm for fractional packing and covering linear programs (linear progr...
Abstract We give an approximation algorithm for fractional packing and covering linear programs (lin...
We describe the first nearly linear-time approximation algorithms for explicitly given mixed packing...
We develop fast approximations for several LP relaxations that arise in discrete and combinatorial o...
We study nearly-linear time approximation algorithms for non-preemptive scheduling problems in two s...
This paper presents an acceleration framework for packing linear programming problems where the amou...
We give a lower bound on the iteration complexity of a natural class of Lagrangianrelaxation algorit...
Many problems in machine learning can be solved by rounding the solution of an appropriate linear pr...
In the dynamic linear program (LP) problem, we are given an LP undergoing updates and we need to mai...
We study an important case of integer linear programs (ILPs) of the form max{c(T)x vertical bar Ax =...
We consider a class of linear programs involving a set of covering constraints of which at most k ar...
We consider a class of linear programs involving a set of covering constraints of which at most k ar...
We obtain faster algorithms for problems such as r-dimensional matching and r-set packing when the s...
Packing and covering linear programs (PC-LP s) form an important class of linear programs (LPs) acro...
Positive linear programs (LPs), or equivalently, mixed packing and covering LPs, are LPs formulated ...
We give an approximation algorithm for fractional packing and covering linear programs (linear progr...
Abstract We give an approximation algorithm for fractional packing and covering linear programs (lin...
We describe the first nearly linear-time approximation algorithms for explicitly given mixed packing...
We develop fast approximations for several LP relaxations that arise in discrete and combinatorial o...
We study nearly-linear time approximation algorithms for non-preemptive scheduling problems in two s...
This paper presents an acceleration framework for packing linear programming problems where the amou...
We give a lower bound on the iteration complexity of a natural class of Lagrangianrelaxation algorit...
Many problems in machine learning can be solved by rounding the solution of an appropriate linear pr...
In the dynamic linear program (LP) problem, we are given an LP undergoing updates and we need to mai...
We study an important case of integer linear programs (ILPs) of the form max{c(T)x vertical bar Ax =...
We consider a class of linear programs involving a set of covering constraints of which at most k ar...
We consider a class of linear programs involving a set of covering constraints of which at most k ar...
We obtain faster algorithms for problems such as r-dimensional matching and r-set packing when the s...