There are 1 repository under approximation-algorithms topic.
A curated list of mathematics documents ,Concepts, Study Materials , Algorithms and Codes available across the internet for machine learning and deep learning
Na Rinha de Algoritmos você deve utilizar suas habilidades para a criação de algoritmos eficientes para resolver problemas!
This is my personal library of code that is common to my different projects (Photosounder, SplineEQ, Spiral and others)
A framework based on the tensor train decomposition for working with multivariate functions and multidimensional arrays
DynaHist: A Dynamic Histogram Library for Java
Fast and memory-efficient clustering + coreset construction, including fast distance kernels for Bregman and f-divergences.
Set of simple mathematical classes in C# (Vectors, Matrixes, Polynoms, Systems of linear equations, Integrals methods, Complex numbers, Rational numbers, Graphs, Methods for solving differential equations) + some features such as memoize (function values memorising)
Graphically solve a texture packing problem with three approximate algorithms
A simple, often-used multiprocessor scheduling (load balancing) algorithm is the LPT algorithm (Longest Processing Time) which sorts the jobs by its processing time and then assigns them to the machine with the earliest end time so far.
Algorithms and functions for fast exponentiation with small error
A Python library for anti-clustering algorithms
Study about an algorithm for discovering small target sets in social networks This is a widely studied problem that abstracts many phenomena in the social, economic, biological, and physical sciences. It is known that this optimization problem is hard to approximate.
Graph-based Deterministic Policy Gradient for Repetitive Combinatorial Optimization Problems
Real-time Interactive Barnes-Hut N-Body Simulator. Create galaxies, apply forces, visualize spatial partitioning, parameterize simulation physics and entities, etc.
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
With this project we researched, implemented and analyzed different algorithms to effectively and efficiently solve an NP-Complete problem such as the Minimum Vertex Cover (MVC).
A C++ implementation of the Christofides algorithm for instances in TSPLIB format
Solving TSP for Metric Graphs using MST Heuristic, and comparing the optimal solution with the approximation one
State-of-art algorithm for sorting by transpositions based on an algebraic approach with guarantee of approximation ratio of 1.375
Memory-efficient probabilistic counter namely Morris Counter
Multi-level Node weighted Steiner trees - implementation of heuristics to compute them
The Hashed-Octree approach is developed as an improvement to the standard octree data structure made suitable for parallel processing. This variant of the octree data structure attempts to parallelize the hierarchical method through adaptive domain decomposition, dynamic load-balancing across processors, and parallel interaction computation.
Python implementation of an approximate Euclidean bipartite matching algorithm proposed by a 2004 paper "A Near-Linear Constant-Factor Approximation for Euclidean Bipartite Matching?" by Pankaj Agarwal and Kasturi Varadarajan.
This project focuses on comparing different Reinforcement Learning Algorithms, including monte-carlo, q-learning, lambda q-learning epsilon-greedy variations, etc.
Quasi-equilibrium analysis of ecosystem C, N and P interactions
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
Project for CSE551 Fundamentals of Algorithms written in Clojure.
"Algorithm Design" Course Material
Very small Julia package to find the best exponential approximation of a given number
Approximate Pattern Mining in Labeled Graphs
This repository contains the experiments conducted in the paper: "Distributed Clustering via LSH Based Data Partitioning" (ICML 2018) with synthetic data. This implementation is not a distributed implementation. It is a single machine implementation intended to demonstrate the properties of this technique and approximation results.
Solving subset sum problem by backtracking and Approximation approach
Network flow-based optimisation model for the analysis of the evacuation plan for the Campi Flegrei red zone in Python, Gurobi and OSMnx.
Steinberg algorithm with two heuristics for Strip Packing Problem