Skip to content

Author

J. Bermond

We have 1 of 206 papers

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

This paper fully characterize the set of requests of an optimal solution to the MARPG problem and shows how to compute in constant time its cardinality, and establishes upper bounds on the number of anomalies.

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.