On ring grooming in optical networks

DOI10.1007/S10878-006-9012-XzbMATH Open1126.05018OpenAlexW2053655138MaRDI QIDQ2385478FDOQ2385478

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

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

zbMATH Keywords

MatchingApproximation algorithmsRing grooming

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• The ring grooming problem
• Title not available (Why is that?)

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)