finding a short spanning walk throw a connected graph (NP-HARD problem)
-
Updated
Oct 8, 2024 - C++
#
np-hard
Here are 23 public repositories matching this topic...
UAV path planning using Genetic Algorithm
-
Updated
Mar 9, 2021 - C++
Optimized Delegated Byzantine Fault Tolerance
-
Updated
Mar 5, 2018 - C++
A hybrid genetic algorithm for the job shop scheduling problem
-
Updated
Jan 25, 2020 - C++
Ant Colony Optimization algorithm solving Google HashCode 2020 online elimination problem
-
Updated
Apr 13, 2024 - C++
Application Data Distribution in Edge Computing
-
Updated
Jun 4, 2021 - C++
All my implemented solutions of various problems of different online judges and competitions
algorithms competitive-programming backtracking np-hard greedy dynamic-programming problem-solving topological-sort tsp coloring-graph networkflow knapsack floodfill connected-components divide-and-conquer strongly-connected-components graphtheory shortest-path-algorithm bicoloring graph-algorigthms
-
Updated
Aug 26, 2025 - C++
Application of a greedy heuristic to the shortest common superstring problem (SCS).
-
Updated
Jun 24, 2020 - C++
Russian Doll Search for Computing Maximum Vertex Weight Hereditary Structures in Graphs. Now with OpenMP support.
-
Updated
Dec 30, 2024 - C++
An implementation of the Particle Swarm Optimization method applied to the specific problem of Bike Sharing Redistribution
-
Updated
Jan 29, 2021 - C++
I love TSP problem, I usually use this in other topics but here need to design TSP problem to find minimum cost for moving between cities.
cpp np-hard tsp nphard travelling-salesman tsp-problem travelling-salesman-problem tsp-solver travelling-salesperson-problem
-
Updated
Jan 20, 2022 - 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.
cplusplus graph-algorithms np-hard dfs heuristics kruskal-algorithm minimum-spanning-tree approximation-algorithm
-
Updated
Dec 11, 2023 - C++
Traveling Salesman Problem, FEUP-DA project
-
Updated
May 24, 2024 - C++
Implementation of the data reduction rule AlmostClique by Böcker et al.. This repository is part of my bachelor thesis.
-
Updated
Nov 18, 2021 - C++
A local search algorithm to solve the Minimum-Weighted Vertex Cover (MWVC) problem.
-
Updated
Dec 14, 2023 - C++
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++
Approaching the assembly line problem from an exhaustive, greedy and metaheuristic POV 🎛
-
Updated
Jan 24, 2020 - C++
Solves two variants of the Interval Scheduling Maximization Problem (ISMP): Weighted and Unwieghted.
-
Updated
Feb 6, 2023 - C++
Ant Colony Optimization algorithm solving Google HashCode 2020 online elimination problem
-
Updated
Apr 13, 2024 - C++
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."