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

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.

Office hours: Anupam (Wed 3-4 pm, GHC 7203), Pravesh (Mon 1-2 pm, GHC 7105), Xinyu (Wed 4:30-5:30 on Zoom). Location: GHC 4211, Mon/Wed/Fri 10:10-11:30. Please note that we meet three days a week (M/W ...

Article Views are the COUNTER-compliant sum of full text article downloads since November 2008 (both PDF and HTML) across all institutions and individuals. These metrics are regularly updated to ...

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

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

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

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