Introduction - If you have any usage issues, please Google them yourself
procedures with the greedy algorithm to solve two hours coverage. Using greed criteria : A time to choose from a peak accession coverage options : To B coverage can not be covered by the largest number of vertices of the vertex.
Packet : 474064二分覆盖问题.rar filelist
二分覆盖问题.cpp