Login / Signup

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

Philip N. KleinNeal E. Young
Published in: SIAM J. Comput. (2015)
Keyphrases
  • approximation algorithms
  • special case
  • constant factor
  • vertex cover
  • computational complexity
  • np hard
  • randomized algorithms
  • constant factor approximation