https://github.com/sleekpanther/minimum-weighted-vertex-cover-approximation-algorithm

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

algorithm algorithm-design approximation approximation-algorithms edge-cost graph minimum-weighted-vertex-cover noah noah-patullo noahpatullo np-complete pattullo pattulo patullo patulo pricing-method vertex vertex-cover vertices weighted-vertex-cover

Last synced: 27 Jul 2025