关键词: 最小测试集 贪心算法 整性间隙 对偶拟合 线性规划松弛 测试集 近似比 最小 贪心算法 证明方法 集合覆盖 拟合方法 间隙

Abstract: The up-to-date best approximation ratio of minimum test set is 2ln n＋o（1）of the greedy algorithm. It is an open problem if this approximation ratio can be improved. This paper discusses the ability of the methods for proof of the approximation ratios base

Key words: Minimum test set, Greedy algorithm, Integrality gap, Dual fitting