activity
20232026
most citedApproximation algorithms for Job Scheduling with reconfigurable resources

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing 2024Show all

2 papers · 1 filter

cs.DS2024

Quasilinear-time eccentricities computation, and more, on median graphs

Pierre Bergé, Guillaume Ducoffe, Michel Habib

Computing the diameter, and more generally, all eccentricities of an undirected graph is an important problem in algorithmic graph theory and the challenge is to identify graph cla…

cs.DS2024

The Canadian Traveller Problem on outerplanar graphs

Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev +5

We study the -Canadian Traveller Problem, where a weighted graph with a source and a target are given. This problem also has a hidden input $E_* \s…