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
A solver for the maximum(-weight) independent set and the maximum(-weight) clique problems
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”.
Assignments done during CS403, Even Semester 2016-2017, IIT Mandi
Fontys Academic Preparations Exercise - Vertex Cover Algorithm
Combinatorial Optimization and Graph Algorithms in Julia
This repository contains the assignments done during the Linear Optimization course offered by Indraprastha Institute of Information Technology, Delhi during Winter 2023.
Hybrid greedy algorithm to compute Minimum Vertex Cover.
Python tools for visualizing and generating examples of "circular societies" in approval voting.
Research project on algorithms for Minimum Vertex Cover Problem + Our algorithm
Parameterized Streaming Algorithms for Vertex Cover
Vertex Cover Optimization problem solved with C++ and Python using Inter-Process Communication in Ubuntu Linux OS.
Analyzed algorithmic efficiency of three approaches to solving the minimum vertex cover for undirected graphs of various sizes.
Final project for graduate course ECE650 @ University of Waterloo
ECE 208 Bonus Assignment
ACM ICPC World Finals 2017 Problem C
Approximation and randomized algorithms - Assignment 01 - SAT
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."