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.
· Networks · 1 citation