In this article, we study multirobot path planning for persistent monitoring tasks. We consider
the case where robots have a limited battery capacity with a discharge time. We represent …

We devise a new approximation algorithm for capacitated vehicle routing. Our algorithm
yields a better approximation ratio for general capacitated vehicle routing as well as for the …

Given an undirected weighted graph G=(V, E), a set {C 1, C 2,…, C k} of cycles is called a
cycle cover of the vertex subset V′ if V′⊆∪ i= 1 k V (C i) and its cost is given by the …

One of the most valuable and promising applications for Unmanned aerial vehicles (UAVs)
is in natural disaster management, where these aircraft can operate autonomously without …

In this paper we study multi-robot path planning for persistent monitoring tasks. We consider
the case where robots have a limited battery capacity with a discharge time $ D $. We …

Given an undirected weighted graph G=(V, E) with nonnegative weight function obeying the
triangle inequality, a set {C 1, C 2,…, C k} of cycles is called a cycle cover if V⊆⋃ i= 1 k V (C …

We develop a general framework for designing polynomial-time approximation schemes
(PTASs) for various vehicle routing problems in trees. In these problems, the goal is to …

We study the unit-demand capacitated vehicle routing problem in the random setting of the
Euclidean plane. The objective is to visit $ n $ random terminals in a square using a set of …

We present efficient algorithms for computing optimal or approximately optimal strategies in
a zero-sum game for which player I has n pure strategies and player II has an arbitrary …

We develop polynomial-size LP-relaxations for orienteering and the regret-bounded vehicle
routing problem (RVRP) and devise suitable LP-rounding algorithms that lead to various …