The ring grooming problem

DOI10.1002/net.20029zbMath1056.90022arXivmath/0101091OpenAlexW2056667633MaRDI QIDQ4651930

Timothy Y. Chow, Philip J. Lin

Publication date: 23 February 2005

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0101091

zbMATH Keywords

parameterized complexitytraffic groomingADM minimizationring loadingBLSRSONET over WDM

Mathematics Subject Classification ID

Integer programming (90C10) Traffic problems in operations research (90B20)

Related Items (7)

Hardness and approximation of traffic grooming ⋮ Optimization in telecommunication networks ⋮ Parameterized complexity of finding small degree-constrained subgraphs ⋮ On approximating the \(d\)-girth of a graph ⋮ Hardness and Approximation of Traffic Grooming ⋮ On Approximating the d-Girth of a Graph ⋮ Traffic grooming in bidirectional WDM ring networks

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: The ring grooming problem