DynaHist: A Dynamic Histogram Library for Java
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
State-of-art algorithm for sorting by transpositions based on an algebraic approach with guarantee of approximation ratio of 1.375
Solving TSP for Metric Graphs using MST Heuristic, and comparing the optimal solution with the approximation one
Approximation Algorithm for the NP-Complete problem of balancing job loads on machines. Does not guarantee an optimal solution, but instead, a solution is within a factor of 1.5 of the optimal solution
This program implements three approximation methods for building a chart of differential equation. Methods: Euler, Improved Euler, Runge-Kutta
Algorithms und Data Structures - Course at OTH Regensburg
Probabilistic analysis of self-stabilizing systems: A case study on a mutual exclusion algorithm
Repository for projects in Advanced Algorithms course at TU Delft.
🔁 Some irrational number approximation algorithms.
Add a description, image, and links to the approximation-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the approximation-algorithms topic, visit your repo's landing page and select "manage topics."