- Notifications
You must be signed in to change notification settings - Fork 2
Approximation Algorithm for the NP-Complete problem of finding a vertex cover of minimum weight in a graph with weighted vertices. Guarantees an answers at most 2 times the optimal minimum weighted vertex cover
SleekPanther/minimum-weighted-vertex-cover-approximation-algorithm
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
About
Approximation Algorithm for the NP-Complete problem of finding a vertex cover of minimum weight in a graph with weighted vertices. Guarantees an answers at most 2 times the optimal minimum weighted vertex cover
Topics
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published