GitHub / 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
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SleekPanther%2Fminimum-weighted-vertex-cover-approximation-algorithm
PURL: pkg:github/SleekPanther/minimum-weighted-vertex-cover-approximation-algorithm
Stars: 8
Forks: 2
Open issues: 1
License: None
Language: Java
Size: 875 KB
Dependencies parsed at: Pending
Created at: about 8 years ago
Updated at: over 1 year ago
Pushed at: over 6 years ago
Last synced at: 3 months ago
Topics: 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