We proved that minimum set cover problem is np complete. Then we came up with an algorithm and analyzed complexity. In the end we compared implementation performance with algorithm analysis. heck the pdf in the repo for detailed explanation
fthdrmzzz/MinSetCover-Analysis
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|