🧙🏾♂️ Complex Algorithms and Complexity Course from the University of San Diego
-
Updated
Nov 8, 2020 - Python
#
np-completeness
Here are 5 public repositories matching this topic...
Algorithms-Specialization from Stanford:
algorithms
graphs
python3
data-structures
sorting-algorithms
dynamic-programming
greedy-algorithms
hash-tables
divide-and-conquer
randomized-algorithms
spanning-trees
np-completeness
-
Updated
Jul 24, 2020 - Python
Homeworks done in course CS 599: Algorithms - Design, Analysis, and Implementations at Oregon State University
graph-algorithms
quicksort
mergesort
network-flow
backtracking
sliding-puzzle
sorting-algorithms
heapsort
8-puzzle
n-queens
prims-algorithm
bubblesort
kruskals-algorithm
prime-factorization
dinic-algorithm
ford-fulkerson-algorithm
np-completeness
bfs-search
dfs-search
edmund-karp-algorithm
-
Updated
Dec 7, 2020 - Python
This repo contains the implementation of an heuristic to solve the Traveling Tournament Problem (TTP), as well as the implementation of the Meta-heuristics' algorithm Iterated Local Search (ILS) satisfying the predefined contraints of the NP-hard problem.
np-hard
heuristics
metaheuristics
combinatorial-optimization
iterated-local-search
traveling-tournament
np-completeness
-
Updated
Jul 5, 2022 - Python
Coursera Data Structures and Algorithms Specialization course 5 --> Advanced Algorithms and Complexity... Code is completed in python only.
-
Updated
Sep 29, 2020 - Python
Improve this page
Add a description, image, and links to the np-completeness topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the np-completeness topic, visit your repo's landing page and select "manage topics."