Multi-robot systems (MRS) are a group of robots that are designed aiming to perform some
collective behavior. By this collective behavior, some goals that are impossible for a single …

While graph covering is a fundamental and well-studied problem, this field lacks a broad
and unified literature review. The holistic overview of graph covering given in this article …

Sweep coverage plays an important role in many applications like data gathering, sensing
coverage, and devices control. In this paper, we deal with the sweep coverage problem with …

In this paper we provide improved approximation algorithms for the Min-Max Tree Cover and
Bounded Tree Cover problems. Given a graph G=(V, E) with weights w: E→ ℤ+, a set T 1, T …

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 …

Complete coverage path planning (CPP) generates a path following which a robot can cover
all free spaces in an environment. Compared with single robot CPP, multi-robot CPP gains …

This paper studies a min–max location-routing problem, which aims to determine both the
home depots and the tours for a set of vehicles to service all the customers in a given …

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 …

Given k identical salesmen, where k⩾ 2 is a constant independent of the input size, the min–
max k-traveling salesmen problem on a tree is to determine a set of k tours for the salesmen …

We study the problem of covering the vertices of an undirected weighted graph with a given
number of trees (cycles, paths) to minimize the weight of the maximum weight tree (cycle …