On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms

Philip N. Klein Neal E. Young

Published in: CoRR (2002)

Keyphrases

approximation algorithms
np hard
constant factor
computational complexity
worst case
optimal solution
optimization problems
linear programming
minimum cost
vertex cover
constant factor approximation