Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations
From MaRDI portal
Publication:5470716
DOI10.1137/S0097539705447293zbMath1096.68165MaRDI QIDQ5470716
No author found.
Publication date: 1 June 2006
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Large-scale problems in mathematical programming (90C06) Minimax problems in mathematical programming (90C47) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items (6)
Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design ⋮ On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms ⋮ Towards more practical linear programming-based techniques for algorithmic mechanism design ⋮ A generalized approximation framework for fractional network flow and packing problems ⋮ Faster min-max resource sharing in theory and practice ⋮ Self-concordant barriers for convex approximations of structured convex sets
This page was built for publication: Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations
