14 citations · 17 across the 7 of their papers we have counts for
7 papers
Scheduling on Hybrid Platforms: Improved Approximability Window
Vincent Fagnon, Imed Kacem, Giorgio Lucarelli +1
Modern platforms are using accelerators in conjunction with standard processing units in order to reduce the running time of specific operations, such as matrix operations, and imp…
An Approximate Pareto Set for Minimizing the Maximum Lateness and Makespan on Parallel Machines
Gais Alhadi, Imed Kacem, Pierre Laroche +1
We consider the two-parallel machines scheduling problem, with the aim of minimizing the maximum lateness and the makespan. Formally, the problem is defined as follows. We have to…
Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times under Non-Availability or Deadline Constraints
Imed Kacem, Hans Kellerer
In this paper, we consider four single-machine scheduling problems with release times, with the aim of minimizing the maximum lateness. In the first problem we have a common deadli…
Approximation Algorithms for the Open Shop Problem with Delivery Times
Imed Kacem, Christophe Rapine
In this paper we consider the open shop scheduling problem where the jobs have delivery times. The minimization criterion is the maximum lateness of the jobs. This problem is known…
On the visualization of the detected communities in dynamic networks: A case study of Twitter's network
Youcef Abdelsadek, Kamel Chelghoum, Francine Herrmann +2
Understanding the information behind social relationships represented by a network is very challenging, especially, when the social interactions change over time inducing updates o…
Triangles as basis to detect communities: an application to Twitter's network
Youcef Abdelsadek, Kamel Chelghoum, Francine Herrmann +2
Nowadays, the interest given by the scientific community to the investigation of the data generated by social networks is increasing as much as the exponential increasing of social…
Algorithms for the Pagination Problem, a Bin Packing with Overlapping Items
Aristide Grange, Imed Kacem, Sébastien Martin
We introduce the strongly NP-complete pagination problem, an extension of BIN PACKING where packing together two items may make them occupy less volume than the sum of their indivi…