Abstract
We have proposed a heuristic algorithm of the minimal set covering problem in our previous work about the Link Failure Detection, and proved that the algorithm is superior to the Greedy algorithm in solving the minimal set covering problem incurred from the Link Failure Detection. In this paper, we proposed an improvement of the heuristic algorithm, lowering its worst cast time complexity from the order of 3 to the order of 2. Also, we surveyed the Greedy based heuristic algorithms of the minimal set covering problem, which are similar to our heuristic algorithm, applied thorough simulation to prove that the heuristic algorithm we proposed is superior to all the other greedy based heuristic algorithms in various kind of minimal set covering problems.