In the set cover problem, we are given a universe U, such that |U| = n, and sets S1,... ,Sk ⊆ U. A set cover is a collection C of some of the sets from S1,... ,Sk whose union is the entire universe U. Formally, C is a set cover if S Si∈C Si = U. We would like to minimize |C|.
import project to eclipse and specify one of the subset files as command line argument
or
run the jar file using the command : java -jar greedySetCover.jar subSets[#].txt
This project is a part of the Advanced Algorithms and Data Structures subject at the University of Ioannina