Preserving approximation in the Min—Weighted Set Cover Problem

In this paper we prove that the approximate solutions to the Min-Weighted Set Cover Problem provided by Chvatalʹs algorithm are combinatorially k-stable with respect to element insertions.