On the max min vertex cover Problem

  title={On the max min vertex cover Problem},
  author={Nicolas Boria and Federico Della Croce and Vangelis Th. Paschos},
  journal={Discrete Applied Mathematics},
We address the max min vertex cover problem, which is the maximization version of the well studied min independent dominating set problem, known to be NP-hard and highly inapproximable in polynomial time. We present tight approximation results for this problem on general graphs, namely a polynomial approximation algorithm which guarantees an n approximation ratio, while showing that unless P = NP, the problem is inapproximable within ratio n for any strictly positive ε. We also analyze the… CONTINUE READING