1 research outputs found

    DOI 10.1007/s10878-006-9012-x On Ring Grooming in optical networks

    No full text
    universe {0, 1,...,n − 1} and an integer g ≥ 2. The unrestricted variant of Ring Grooming, referred to as Unrestricted Ring Grooming, seeks a partition {P1, P2,...,Pk} of {1, 2,...,m} such that |Pi | ≤g for each 1 ≤ i ≤ k and ∑k i=1 r∈Pi Ar | is minimized. The restricted variant of Ring Grooming, referred to as Restricted Ring Grooming, seeks a partition {P1, P2,...,P ⌈ m g ⌉} of {1, 2,...,m} such that |Pi | ≤g for each 1 ≤ i ≤ ⌈ m ⌉ an
    corecore