Christian Laforest

Learn More
In this paper, we consider the classical NP-complete VERTEX COVER problem in large graphs. We assume that the size and the access to the input graph impose the following constraints: (1) the input graph must not be modified (integrity of the input instance), (2) the computer running the algorithm has a memory of limited size (compared to the graph) and (3)(More)
This paper presents a distributed algorithm for the general dynamic resource allocation problem. A process may request any subset of the system resources (that may be available in several instances) during a request session. We focus on the message complexity which measures the number of messages a process incurs when it requests resources. The proposed(More)
In this paper we describe routing functions for optical packets in point-to-point networks. These functions are based on Eulerian tours. We first define different measures to handle the efficiency of this routing. Then, we describe an algorithm to compute these measures. Moreover, we present such an Eulerian routing in the Square Mesh and we prove that the(More)
In this paper we prove the (constant) competitiveness of an online algorithm for scheduling jobs on multiple machines, supporting a mechanism of penalties for the scheduler/operator. Our context (online, multiple machines, supporting parameterizable penalties) is more general than in previous existing works. The main contribution of our paper is the (non(More)
The vertex cover is a well-known NP-complete minimization problem in graphs that has received a lot of attention these last decades. Many algorithms have been proposed to construct vertex cover in different contexts (offline, online, list algorithms, etc.) leading to solutions of different level of quality. This quality is traditionally measured in terms of(More)