Michel Cosnard

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

ABSTRACT 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 capa...