We give approximation algorithms and inapproximability results for a class of movement
problems. In general, these problems involve planning the coordinated motion of a large …

One of the challenges in surface defects evaluation of large fine optics is to detect defects of
microns on surfaces of tens or hundreds of millimeters. Sub-aperture scanning and stitching …

The task of the broadcast problem is, given a graph G and a source vertex s, to compute the
minimum number of rounds required to disseminate a piece of information from s to all …

The crossed cube is a popular network topology because it possesses many attractive
topological properties and its diameter is about half that of the hypercube. Typically, a …

We study the shortest-path broadcast problem in graphs and digraphs, where a message
has to be transmitted from a source node s to all the nodes along shortest paths, in the …

The irregular switch-based network of workstations is fast becoming a cost-effective platform
for high performance computing. This paper presents efficient multicasting with reduced link …

We consider the communications involved by the execution of a complex application
deployed on a heterogeneous platform. Such applications extensively use macro …

This paper addresses the minimum-time broadcast problem under several modes of the line
model, ie, when long-distance calls can be placed along paths in the network. It is well …

In this paper, we show that the multicast problem in trees can be expressed in term of
arranging rows and columns of boolean matrices. Given apq matrix M with 0-1 entries, the …

In this paper, we consider the communications involved in the execution of a complex
application, deployed on a heterogeneous platform. Such applications extensively use …