Lower bounds for two-period grooming via linear programming duality

In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so that the induced subgraphs on a specified set of v n vertices each contain at most C < C edges. The cost of the grooming is the sum, over all subgraphs, of the number of vertices of nonzero degree in the subgraph. The optimum grooming is the one of lowest cost. An integer linear programming formulation is used to determine precise lower bounds on this minimum cost for all choices of n and v when 1 C < C 3. In most cases, this approach determines not only the bound but also the specific structure of any grooming that could realize the bound.

• Type: Journal
• Year: 2008
• Where: NETWORKS
• Authors: Charles J. Colbourn, Gaetano Quattrocchi, Violet R. Syrotiuk
• Keywords: Complete Graph, Computer Networks, NETWORKS 2008, Nonzero Degree, Two-period Optical Networks