GitHub / eduardosantoshf / randomized-algorithm-for-combinatorial-problem

AA Second Project - 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.

JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/eduardosantoshf%2Frandomized-algorithm-for-combinatorial-problem

Topics: combinatorial-problems, monte-carlo-methods, randomized-algorithms

• Files
• Readme
• Dependencies