We consider a single Unmanned Aerial Vehicle (UAV) routing problem where there are
multiple depots and the vehicle is allowed to refuel at any depot. The objective of the …

Given an arc-weighted directed graph G=(V, A,/spl lscr/) and a pair of nodes s, t, we seek to
find an st walk of length at most B that maximizes some given function f of the set of nodes …

We examine the problem of utilizing an autonomous underwater vehicle (AUV) to collect
data from an underwater sensor network. The sensors in the network are equipped with …

We present a randomized O (log n/log log n)-approximation algorithm for the asymmetric
traveling salesman problem (ATSP). This provides the first asymptotic improvement over the …

In this article, we consider the orienteering problem in undirected and directed graphs and
obtain improved approximation algorithms. The point to point-orienteering problem is the …

This paper is about the allocation of tours of m targets to n vehicles. The motion of the
vehicles satisfies a nonholonomic constraint (ie, the yaw rate of the vehicle is bounded) …

We give a constant-factor approximation algorithm for the asymmetric traveling salesman
problem (ATSP). Our approximation guarantee is analyzed with respect to the standard LP …

Written examination is a conventional yet universal tool to evaluate the student's
performance in a subject area, where the required cognitive ability is defined through items …

A recent line of treemap research has focused on layout algorithms that optimize properties
such as stability, preservation of ordering information, and aspect ratio of rectangles. No …

We show that the integrality gap of the natural LP relaxation of the Asymmetric Traveling
Salesman Problem is polyloglog (n). In other words, there is a polynomial time algorithm that …