Skip to content
#

np-complete

Here are 107 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

With this project we researched, implemented and analyzed different algorithms to effectively and efficiently solve an NP-Complete problem such as the Minimum Vertex Cover (MVC).

  • Updated Jan 11, 2023
  • Python

Improve this page

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

Learn more