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
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).
Graph decomposition algorithms for MaxClique and Minimum Vertex Cover problems
Custom unembedding techniques for quantum annealers
An efficient simulated annealing algorithm applied to the Minimum Vertex Cover Problem
Unofficial C++ implementation of NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover (http://arxiv.org/abs/1402.0584).
A report and comparison on various approximation algorithms for solving the minimum vertex cover problem.
Solutions for various Kattis programming challenges about optimisation algorithms
Add a description, image, and links to the minimum-vertex-cover topic page so that developers can more easily learn about it.
To associate your repository with the minimum-vertex-cover topic, visit your repo's landing page and select "manage topics."