Description: 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.
To Search:
File list (Check if you may need any files):
Download