- Notifications
You must be signed in to change notification settings - Fork0
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.
eduardosantoshf/randomized-algorithm-for-combinatorial-problem
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
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 theAdvanced Algorithms course ofUniversity of Aveiro.
You can find the running steps inside thereport.pdf file.
This project's grade was17 out of 20.
- Eduardo Santos:eduardosantoshf
About
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.
Topics
Resources
Uh oh!
There was an error while loading.Please reload this page.
Stars
Watchers
Forks
Uh oh!
There was an error while loading.Please reload this page.