The objective of this project was to design and test a randomized algorithm to solve the combinatorial problem from the first assignment, which was to find a minimum weighted closure for a given vertex-weighted directed graph G(V, E), with n vertices and m edges. This randomized algorithm was based on the Monte Carlo algorithms, and all the computations were made using a variety of parameters, which are referred on the report.
This project was developed under the Advanced Algorithms course of University of Aveiro.
You can find the running steps inside the report.pdf file.
This project's grade was 17 out of 20.
- Eduardo Santos: eduardosantoshf