A Tighter Analysis of Set Cover Greedy Algorithm for Test Set

@inproceedings{Cui2007ATA,
  title={A Tighter Analysis of Set Cover Greedy Algorithm for Test Set},
  author={Peng Cui},
  booktitle={ESCAPE},
  year={2007}
}
Set cover greedy algorithm is a natural approximation algorithm for test set problem. This paper gives a precise and tighter analysis of approximation guarantee of this algorithm. The author improves the performance ratio 2 ln n which derives from set cover problem to 1.14 lnn by applying the potential function technique. In addition, the author gives a nontrivial lower bound 1.00044 ln n of performance ratio of this algorithm. This lower bound, together with the matching bound of information… CONTINUE READING

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…