Skip to content
#

randomized-algorithms

Here are 48 public repositories matching this topic...

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.

  • Updated Jan 23, 2023
  • TeX

Improve this page

Add a description, image, and links to the randomized-algorithms topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the randomized-algorithms topic, visit your repo's landing page and select "manage topics."

Learn more