Approximation_Algorithms_Vertex_Cover

Implemented the logic for various algorithms to get optimal vertex cover

Results:

The Results show LP-Based Rounding Algorithm provides the best result with lowest total vertex cover cost

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
.gitignore		.gitignore
README.md		README.md
greedy_vc.py		greedy_vc.py
integral_vc.py		integral_vc.py
linear_vc.py		linear_vc.py
pricing_vc.py		pricing_vc.py
randomNodeGen.py		randomNodeGen.py