"topic:np-hard-problems" — Search | GitHunt

Repositories Developers Collections

© 2026 GitHunt · tansuasici

7 results for “topic:np-hard-problems”

supreethmv/GCS-Q

GCS-Q is a coalition structure generation algorithm for induced subgraph games

Jupyter Notebook61Updated 1 year ago

coalition-game-theorycomplexitycomplexity-analysiscomplexity-theorygame-theorymulti-agent-systemsnp-hardnp-hard-problemnp-hard-problemsoptimizationquantumquantum-annealingquantum-computingquantum-optimization

Simulated annealing which uses thermodynamics of the landscape to escape local minima and works amazingly on discrete combinatorial problems

C++32Updated 1 month ago

combinatorial-optimizationhardness-measurementlambert-wnp-hard-problemssimulated-annealingthermodynamics

ffengc/CSCI570-Analysis-of-Algorithms-USC

Code written for lectures and homework in USC CSCI570-Analysis-of-Algorithms Course 🚀🚀🚀

C++10Updated 3 months ago

algorithmscomputational-complexitydynamic-programminggraph-algorithmsgreedy-algorithmsheapsmatching-algorithmnetwork-flowsnp-hard-problemsnp-problemstsp-problem

frankvegadelgado/hvala

Hvala: Approximate Vertex Cover Solver

Python10Updated 3 months ago

approximation-algorithmsnp-hard-problemsoptimization-algorithmspolynomial-timevertex-cover

frankvegadelgado/esperanza

Esperanza: Approximate Independent Set Solver

Python10Updated 3 days ago

approximation-algorithmsindependent-set-problemnp-hard-problemsoptimization-algorithmspolynomial-time

Team7-2401/MIS-Project

This repository contains the code used in the CS301 (Algorithms) Project which discusses the Maximum Independent Set Problem

Jupyter Notebook00Updated 1 year ago

academic-projectalgorithmsbrute-force-algorithmscomputational-complexitydata-visualizationgraph-analysisgraph-theoryheuristic-algorithmsjupyter-notebookmaximum-independent-setnp-hard-problemsoptimizationpython

marmitar/MC558-Lista-DadinhoArchived

Selected graph problems for MC558

TeX00Updated 9 months ago

college-assignmentgraph-theorynp-hard-problemsunicamp