-
Combinatorial and algorithmic aspects of identifying codes in graphs
We study combinatorial and algorithmic aspects of identifying codes in graphs. An identifying code is a set of vertices of a graph such that, on the one hand, each... -
Makespan minimisation on parallel batch processing machines with non-identica...
International audience -
Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem
International audience -
Hardness and Approximation Results for Black Hole Search in Arbitrary Networks
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node without leaving any trace. The... -
Approximations for the Two-Machine Cross-Docking Flow Shop Problem
International audience -
Approximation in multiobjective optimization using e-kernels
International audience -
Scheduling stretched coupled-tasks with compatibilities constraints : model, ...
We tackle the makespan minimization coupled-tasks problem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, {\it... -
Analysis of an Approximation Algorithm for Scheduling Independent Parallel Tasks
International audience -
Approximation Algorithms for Multicoloring Planar Graphs and Powers of Square...
International audience -
Message Scheduling for Parallel Data Redistribution between Clusters
International audience -
Redistribution de données entre deux grappes d'ordinateurs
Stage de licence. Rapport de stage. -
Vehicle Sharing Systems Pricing Optimization
One-way Vehicle Sharing Systems (VSS), in which users pick-up and return a vehicle in different places is a new type of transportation system that presents many...
