Skip to content
#

noah-patullo

Here are 27 public repositories matching this topic...

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

  • Updated Jan 12, 2019
  • Java

Approximation Algorithm for the NP-Complete problem of balancing job loads on machines. Does not guarantee an optimal solution, but instead, a solution is within a factor of 1.5 of the optimal solution

  • Updated Jun 22, 2017
  • Java

Improve this page

Add a description, image, and links to the noah-patullo 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 noah-patullo topic, visit your repo's landing page and select "manage topics."

Learn more