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
-
Notifications
You must be signed in to change notification settings - Fork 0
fthdrmzzz/MinSetCover-Analysis
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published