The rectilinear traveling salesperson problem (RTSP) Remember that a coordinate is a number x∈ℜ, and in the plane, a point is a pair (x, y)∈ℜ2.
-
Updated
Jun 7, 2017 - C++
The rectilinear traveling salesperson problem (RTSP) Remember that a coordinate is a number x∈ℜ, and in the plane, a point is a pair (x, y)∈ℜ2.
Graphically solve a texture packing problem with three approximate algorithms
N-body simulation project
Practical PTASes for Feedback Vertex Set in Planar Graphs
Implementation of HyperLogLog algorithm to count number of unique elements in data stream.
Ristretto: Caffe-based approximation of convolutional neural networks.
Multiple Disjunctively Constrained Knapsak problem: definition and an approximation algorithm implementation.
An application in c++ to solve the Travelling Salesman Problem using the Ant Colony System
A C++ implementation of the Christofides algorithm for instances in TSPLIB format
Implementation of an approximation algorithm for the Prize-Collecting Steiner Tree Problem.
Implementation of our paper "An Efficient Approximate Algorithm for Single-Source Discounted Hitting Time Query" (DASFAA2020)
Perturbation Analysis of Practical Algorithms for the Maximum Scatter Travelling Salesman Problem @ ALENEX '22
Calculating the circle number Pi.
This repo contains various exact and approximation algorithm for graph correlation clustering problems.
approximation algorithms for exact nearest neighbors search and clustering on multi-dimensional vectors
Design of Algorithms course second project
Fast and memory-efficient clustering + coreset construction, including fast distance kernels for Bregman and f-divergences.
Calculating digits of pi with arbitrary size and find pattern inside.
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."