Cui Peng

Learn More
Cui P, Liu HJ. Deep approximation of set cover greedy algorithm for test set. Abstract: Test set problem is a NP-hard problem with wide applications. Set cover greedy algorithm is one of the commonly used algorithms for the test set problem. It is an open problem if the approximation ratio 2ln n+1 directly derived from the set cover problem can be improved.(More)
  • 1