Skip to content

Author

Stéphane Pérennes

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access Sep 2026

Maximum Number of Requests on a Path With a Given Grooming Factor

We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application and by its interest in computing lower bounds on the cutwidth of a graph. We are given a directed path on vertices and a positive integer capacity (grooming factor). The MARPG problem consi...

J. Bermond, Michel Cosnard, D. Coudert et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.