Login / Signup

Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems.

M. Reza KhaniMohammad R. Salavatipour
Published in: Algorithmica (2014)
Keyphrases
  • approximation algorithms
  • min max
  • vertex cover
  • randomized algorithms
  • np hard
  • special case
  • minimum cost
  • network design problem
  • exact algorithms
  • np hardness
  • worst case
  • objective function
  • lower bound
  • primal dual