Group 20
This is a algorithm group project for solving Minium Vertex Cover problem.
Four Algorithms implemented
- Construction Heuristics with approximation guarantees.
- Exact algorithm using Branch-and-Bound.
- Local Search: Hill Climbing Algorithm.
- Local Search2: 2-improvement.
Compile and run
The submission includes precompiled MVC.jar
Run:
java -jar MVC.jar -inst /path/to/graph/jazz.graph -alg LS1 -time 600 -seed 1
-alg: LS1, LS2 BnB, Approx
-seed: long type, optional
-time: long type
-inst: path to graph
The order of argument is not fixed
The output file is in current directory The output file will be appended, not overwritten.
For example, if the graph is in current folder
java -jar MVC.jar -inst ./jazz.graph -alg LS1 -time 600 -seed 1
If the graph is in Data folder, which must be a subdirectory of current folder, you can use
java -jar MVC.jar -inst jazz.graph -alg LS1 -time 600 -seed 1
Method to build jar (No need to do this, as jar file is included with submission):
using intelliJ, build a MVC.jar based on Launcher as main class
put the jar file outside of src folder
reference