e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
K-medians, facility location, and the Chernoff-Wald bound
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
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
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
SIAM Journal on Computing
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
Smooth minimization of non-smooth functions
Mathematical Programming: Series A and B
Excessive Gap Technique in Nonsmooth Convex Minimization
SIAM Journal on Optimization
Combinatorial Optimization: Theory and Algorithms
Combinatorial Optimization: Theory and Algorithms
Faster and simpler approximation algorithms for mixed packing and covering problems
Theoretical Computer Science
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Gradient-based algorithms for finding Nash equilibria in extensive form games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
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 | 0.00 |
We consider a generic paradigm to design improved PTAS for linear programming relaxations of combinatorial optimization problems. For the case of the uncapacitated facility location problem, the scheduling problem R∥Cmax and the set covering problem we substantially improve the running time dependence on ε from the previously known O(1/ε2) to O(1/ε). All these algorithms are remarkably simple to implement. For the survivable network design problem we improve the dependence from O(1/ε2) to O((1/ε) log (1/ε)). We present some preliminary computational results that seem to suggest that our algorithms may prove very competitive in practice. Furthermore, we present a general approximation version of a result of Nesterov that potentially can be applied to a very large class of linear programming problems. Our results build mainly on work of Nesterov and extend the work of Bienstock and Iyengar. In fact, one of the objectives of this paper is to make clearer the relationship between these two.