dhavalraj007 / Minimum-set-cover Public

Notifications You must be signed in to change notification settings
Fork 0
Star 1

Implementation of Minimum Set cover problem using two approaches.greedy approach and Linear programming with Repeat randomized rounding

1 star 0 forks Branches Tags Activity

Name		Name	Last commit message	Last commit date
Latest commit History 8 Commits
LP_test		LP_test
.gitattributes		.gitattributes
.gitignore		.gitignore
LP_test.sln		LP_test.sln
README.md		README.md

Repository files navigation

Minimum-set-cover

Implementation of Minimum Set cover problem using two approaches.

Greedy approach. See Greedy.cpp
Linear programming with Repeat randomized rounding. see LpRandom.cpp

dependencies

Overview

Overview : Presentation

Final Report Document : Report