Na Rinha de Algoritmos você deve utilizar suas habilidades para a criação de algoritmos eficientes para resolver problemas!
A framework based on the tensor train decomposition for working with multivariate functions and multidimensional arrays
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.
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.
A Python library for anti-clustering algorithms
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).
Memory-efficient probabilistic counter namely Morris Counter
Multi-level Node weighted Steiner trees - implementation of heuristics to compute them
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.
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.
This is the public repository for the "No-collision Transportation Maps" paper.
CPLEX models and heuristics to solve humanitarian relief supply chains in which the last mile delivery network is a tree or an almost-tree
Steinberg algorithm with two heuristics for Strip Packing Problem
Several methods for data interpolation and approximation
Social network connection analysis on approximation fast algorithm
Tasks from Numerical Analysis course
Approximation and randomized algorithms - Assignment 02 - Subset Sum
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."