-
Updated
Jan 13, 2018 - Rust
np-hard
Here are 113 public repositories matching this topic...
A challenge to make this basic closest-strings program more efficient.
-
Updated
Jan 22, 2020 - C
Application Data Distribution in Edge Computing
-
Updated
Jun 4, 2021 - C++
A program that breaks cycles in undirected and directed graphs (with and without weights), that is, to find the minimum feedback arc set in given graphs.
-
Updated
Dec 11, 2023 - C++
Ant Colony Optimization algorithm solving Google HashCode 2020 online elimination problem
-
Updated
Apr 13, 2024 - C++
Algorithm analysis of NP-Hard problem called Maximum Set Packing.
-
Updated
Jun 15, 2023 - Jupyter Notebook
Deep learning and Reinforcement Learning for solving NP-Hard combinatorial problems like TSP.
-
Updated
Jul 5, 2018
-
Updated
Feb 3, 2017
A test for the my Genetic Library. The Traveling Salesman problem solved with Genetic Algorithms.
-
Updated
Jun 12, 2018 - C#
A Crystal port of @mak-it's 2D Bin Packing solver, using the Maximal Rectangles Algorithm.
-
Updated
Jan 17, 2021 - Crystal
[IC-MII-UGR-2016-17] Práctica de algoritmos evolutivos (genéticos) | Resolución de problemas NP -> QAP
-
Updated
Apr 22, 2017 - JavaScript
All my implemented solutions of various problems of different online judges and competitions
-
Updated
Jan 17, 2023 - C++
Y.Neo Graph のイメージ (publish in 2002, 2023(the code))
-
Updated
Dec 9, 2023 - HTML
Linear time implementation of maximum clique, maximum independent set, minimum vertex coloring, minimum clique cover and maximum weighted clique problems for chordal graphs!!!!!
-
Updated
Oct 16, 2021 - C++
Repository of the paper "CoreGDM: Geometric Deep Learning Network Decycling and Dismantling" by M. Grassia and G. Mangioni
-
Updated
Sep 27, 2023
The ripple-spreading algorithm that determines all Pareto-optimal paths from one node to all other nodes for the multi-objective shortest path problem.
-
Updated
Jul 25, 2022 - Python
Explore different algorithms for Maximum 0-1 Knapsack
-
Updated
May 8, 2017 - Java
Identical machines scheduling, minimizing the makespan
-
Updated
Feb 21, 2022 - Kotlin
Algorithmic approximation to a 4D travelling salesman problem
-
Updated
Apr 4, 2022 - Java
This repository contains a Python implementation of a color coding method for the problem of finding a subtree with k vertices in a given graph.
-
Updated
Jul 26, 2023 - Python
Improve this page
Add a description, image, and links to the np-hard topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the np-hard topic, visit your repo's landing page and select "manage topics."