Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
Coordination complexity of parallel price-directive decomposition
Mathematics of Operations Research
Randomized rounding without solving the linear program
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Strengthening integrality gaps for capacitated network design and covering problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
Mathematics of Operations Research
Approximate Max-Min Resource Sharing for Structured Concave Optimization
SIAM Journal on Optimization
Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Approximating a Finite Metric by a Small Number of Tree Metrics
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Sequential and Parallel Algorithms for Mixed Packing and Covering
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A fast approximation scheme for fractional covering problems with variable upper bounds
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Solving fractional packing problems in Oast(1/ε) iterations
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Approximation Algorithm for the Mixed Fractional Packing and Covering Problem
SIAM Journal on Optimization
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes
SIAM Journal on Discrete Mathematics
An approximation algorithm for the general max-min resource sharing problem
Mathematical Programming: Series A and B
Implementation of approximation algorithms for the max-min resource sharing problem
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Implementation of approximation algorithms for the multicast congestion problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Approximation algorithms for min-max and max-min resource sharing problems, and applications
Efficient Approximation and Online Algorithms
An approximation algorithm for the general mixed packing and covering problem
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
| Hi-index | 5.23 |
We propose an algorithm for approximately solving the mixed packing and covering problem; given a convex compact set 0@?B@?R^N, either compute x@?B such that f(x)@?(1+@e)a and g(x)=(1-@e)b or decide that {x@?B|f(x)@?a,g(x)=b}=0@?. Here f,g:B-R"+^M are vectors whose components are M non-negative convex and concave functions, respectively, and a,b@?R"+"+^M are constant positive vectors. Our algorithm requires an efficient feasibility oracle or block solver which, given vectors c,d@?R"+^M and @a@?R"+, computes x@?@?B such that c^Tf(x@?)-d^Tg(x@?)@?@a or correctly decides that no such x@?@?B exists. Our algorithm, which is based on the Lagrangian or price-directive decomposition method, generalizes the result from [K. Jansen, Approximation algorithm for the mixed fractional packing and covering problem, in: Proceedings of 3rd IFIP Conference on Theoretical Computer Science, IFIP TCS 2004, Kluwer, 2004, pp. 223-236; SIAM Journal on Optimization 17 (2006) 331-352] and needs only O(M(lnM+@e^-^2ln@e^-^1)) iterations or calls to the feasibility oracle. Furthermore we show that a more general block solver can be used to obtain a more general approximation within the same runtime bound.