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