There are 0 repository under minimum-vertex-cover topic.
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
Solutions for various Kattis programming challenges about optimisation algorithms
A report and comparison on various approximation algorithms for solving the minimum vertex cover problem.
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).