SleekPanther/minimum-weighted-vertex-cover-approximation-algorithm Issues
Common interest
UpdatedTry this :)
Closed 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