Skip to content
#

edge-cost

Star

Here is 1 public repository matching this topic...

SleekPanther / minimum-weighted-vertex-cover-approximation-algorithm

Star 8

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

Improve this page

Add a description, image, and links to the edge-cost topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the edge-cost topic, visit your repo's landing page and select "manage topics."

Learn more