###Currently available approximation algorithms for solving the minimum vertex cover problem include:

• Connected Tree Method;
• Shortest Path Method;
• Guaranteed Predictions Methods (2 versions);
• Greedy algorithm (removing vertices with maximum degree);
• Optimized Method based on the heuristic predictions;
• Method based on the covering pairs searching;

###Each algorithm can be analyzed using such additional output:

• Number of the operations performed by the algorithm;
• Problem solving time for each graph instance used during testing;
• Frequency of non-optimal results (in comparison with the exact algorithm);
• Probability of the non-optimal results occurrences;
• Probability of completing all calculations in allowed time.

You can compile this project with help of QtCreator (main project file is called TestingAlgorithms.pro) or from terminal using the following commands:

cd your\build\directory\
qmake TestingAlgorithms.pro -r -spec win32-g++ "CONFIG+=release"
mingw32-make -f Makefile.Release
mingw32-make clean

Note: Instead of mingw32-make as well as -spec parameter you must use versions specific to your Operating System. If you wanna compile in Debug mode replace CONFIG+=release with CONFIG+=debug and Makefile.Release with Makefile.Debug.