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

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.

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

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: As a hierarchical real-time system framework, the Regularity-based Resource Partition Model allocates physical resources in time intervals determined by integral numbers of a time unit to ...

ABSTRACT: This paper presents two solution methodologies for the Visual Area Coverage Scheduling problem. The objective is to schedule a number of dynamic observers over a given 3D terrain such that ...