Topics
algorithmMusic genre
We give an approximation algorithm for fractional 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 (with high probability) computes feasible primal and dual solutions whose costs are within a factor of 1+ε of opt (the optimal cost) in time O((r+c)log(n)/ε2+n)
Given matrices A and B and vectors a, b, c and d, all with non-negative entries, we consider the pro...
AbstractWe propose an algorithm for approximately solving the mixed packing and covering problem; gi...
AbstractThe linear fractional programming (LFP) algorithms attempt to optimize a quotient of two lin...
Abstract We give an approximation algorithm for fractional packing and covering linear programs (lin...
We present a Lagrangian relaxation technique to solve a class of linear programs with negative coeff...
We adapt a method proposed by Nesterov [19] to design an algorithm that computes ε-optim...
Packing and covering linear programs (LP) are an important class of problems that bridges computer s...
This paper presents fast algorithms that find approximate solutions for a general class of problems,...
This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problem...
We describe the first nearly linear-time approximation algorithms for explicitly given mixed packing...
Abstract. We present a price-directive decomposition algorithm to com-pute an approximate solution o...
AbstractGiven matrices A and B and vectors a, b, c and d, all with non-negative entries, we consider...
This paper published in "Computational Optimization and Applications" 2 (1993) 301-31
We present the first fully polynomial approximation schemes for the maximum weighted (un-capacitated...
Abstract This paper gives poly-logarithmic-round, dis-tributed -approximation algorithms for coverin...
Given matrices A and B and vectors a, b, c and d, all with non-negative entries, we consider the pro...
AbstractWe propose an algorithm for approximately solving the mixed packing and covering problem; gi...
AbstractThe linear fractional programming (LFP) algorithms attempt to optimize a quotient of two lin...
Abstract We give an approximation algorithm for fractional packing and covering linear programs (lin...
We present a Lagrangian relaxation technique to solve a class of linear programs with negative coeff...
We adapt a method proposed by Nesterov [19] to design an algorithm that computes ε-optim...
Packing and covering linear programs (LP) are an important class of problems that bridges computer s...
This paper presents fast algorithms that find approximate solutions for a general class of problems,...
This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problem...
We describe the first nearly linear-time approximation algorithms for explicitly given mixed packing...
Abstract. We present a price-directive decomposition algorithm to com-pute an approximate solution o...
AbstractGiven matrices A and B and vectors a, b, c and d, all with non-negative entries, we consider...
This paper published in "Computational Optimization and Applications" 2 (1993) 301-31
We present the first fully polynomial approximation schemes for the maximum weighted (un-capacitated...
Abstract This paper gives poly-logarithmic-round, dis-tributed -approximation algorithms for coverin...
Given matrices A and B and vectors a, b, c and d, all with non-negative entries, we consider the pro...
AbstractWe propose an algorithm for approximately solving the mixed packing and covering problem; gi...
AbstractThe linear fractional programming (LFP) algorithms attempt to optimize a quotient of two lin...
Add to ORKG