项目作者: SleekPanther

项目描述 :
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
高级语言: Java
项目地址: git://github.com/SleekPanther/minimum-weighted-vertex-cover-approximation-algorithm.git