On ring grooming in optical networks

DOI10.1007/S10878-006-9012-XMaRDI QIDQ2385478zbMATH OpenOpenAlexFDO

Authors Gruia Calinescu, Peng-Jun Wan

Publication date 12 October 2007

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-006-9012-x

zbMATH Keywords

MatchingApproximation algorithmsRing grooming

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Partitions of sets (05A18)

Recommendations

• Hardness and Approximation of Traffic Grooming
• The ring grooming problem
• Approximating the traffic grooming problem
• Algorithms and Computation
• Hardness and approximation of traffic grooming

Cites work

• A Greedy Heuristic for the Set-Covering Problem
• Maximum bounded \(H\)-matching is Max SNP-complete

Cited in

(2)

• scientific article; zbMATH DE number 6501125 (Why is no real title available?)
• The ring grooming problem

This page was built for publication: On ring grooming in optical networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2385478)