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
graph
approximation
np-complete
vertices
vertex
patullo
noah
noah-patullo
vertex-cover
algorithm-design
noahpatullo
approximation-algorithms
patulo
pattullo
pattulo
weighted-vertex-cover
minimum-weighted-vertex-cover
pricing-method
edge-cost
-
Updated
Jan 12, 2019 - Java