The ring grooming problem
From MaRDI portal
Publication:4651930
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
Related Items
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