测试集覆盖贪心算法的严密性分析
A Tighter Analysis of Setcover Greedy Algorithm for Test Set
摘要:
集覆盖贪心算法是求解测试集问题的一种自然近似算法。本文对该算法的性能保证进行了较为精确和严密的分析。作者应用势函数技术将由集合覆盖问题导出的性能保证$2\ln n$改进为$1.1354\ln n$。此外,还给出了该算法性能保证的一个非平凡下界$1.0004609\ln n$.该下界与信息量启发式算法的匹配界一起证实了信息量启发式算法在最坏情况下略优于集合覆盖贪心算法的事实。
英文摘要:
Setcover greedy algorithm is a natural approximation algorithm for test set problem. This paper gives a precise and tighter analysis of performance guarantee of this algorithm. The author improves the performance guarantee $2\ln n$ which derives from set cover problem to $1.1354\ln n$ by applying the potential function technique. In addition, the author gives a nontrivial lower bound $1.0004609\ln n$ of performance guarantee of this algorithm. This lower bound, together with the matching bound of information content heuristic, confirms the fact information content heuristic is slightly better than setcover greedy algorithm in worst case.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。