On the Independent Set Interdiction Problem

The purpose of the independent set interdiction problem in the weighted graph G is to determinea set of vertices R* such that the weight of the maximum independent set in G-R* is minimized.We define an approximate solution for this problem. Then, an upper bound for the relative errorof this problem is obtained. We show that the limit of the relative error of the independent setinterdiction problem in some subclasses of the generalized Petersen graphs is zero as the numberof vertices tends to infinity.