A reinforcement learning based solver for combinatorial problems
-
Updated
Jun 22, 2022 - C++
A reinforcement learning based solver for combinatorial problems
Approximation Algorithm for the NP-Complete problem of finding a vertex cover of minimum weight in a graph with weighted vertices. Guarantees an answers at most 2 times the optimal minimum weighted vertex cover
Assignments done during CS403, Even Semester 2016-2017, IIT Mandi
Finding shortest path and minimum vertex cover of the street graph.
In MWVCP, a member of np-complete family, it is required to find the vertex cover of a given graph such that the sum of the weights of the nodes is the minimum. A vertex cover of a graph is “a set of vertices such that each edge of the graph is incident to at least one vertex of the set”.
Final project for graduate course ECE650 @ University of Waterloo
Analyzed algorithmic efficiency of three approaches to solving the minimum vertex cover for undirected graphs of various sizes.
ECE 208 Bonus Assignment
BFS, FLoyd Warshall, topological sorting, etc.
ACM ICPC World Finals 2017 Problem C
Python tools for visualizing and generating examples of "circular societies" in approval voting.
Approximation and randomized algorithms - Assignment 01 - SAT
Fontys Academic Preparations Exercise - Vertex Cover Algorithm
Minimize the number of cameras police need to install, and still be as effective as possible with their monitoring at traffic intersections.
Combinatorial Optimization and Graph Algorithms in Julia
Demonstration to solve the Vertex Cover problem
Add a description, image, and links to the vertex-cover topic page so that developers can more easily learn about it.
To associate your repository with the vertex-cover topic, visit your repo's landing page and select "manage topics."