GitHub

Approximation-algorithms-for-geometric-problems

Submission for the CS421 project "Approximation algorithms for geometric problems". We first compute a Well-Separated-Pair-Decomposition from an octree, and then apply this representation to ...
GitHub

approximation-algorithms

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.
Nature

Approximation Algorithms for the Traveling Salesman Problem

The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route planning ...
IEEE

Approximation Algorithms on Multiprocessor Task Scheduling

Abstract: Multiprocessor task scheduling problem has become increasingly interesting, for both theoretical study and practical applications. Theoretical study of the problem has made significant ...
Microsoft

Stochastic Approximation and Reinforcement Learning: Hidden Theory and New Super-Fast Algorithms

Stochastic approximation algorithms are used to approximate solutions to fixed point equations that involve expectations of functions with respect to possibly unknown distributions. Among many ...
IEEE

Approximation Algorithms for Training One-Node ReLU Neural Networks

Abstract: Training a one-node neural network with the ReLU activation function via optimization, which we refer to as the ON-ReLU problem, is a fundamental problem in machine learning. In this paper, ...