Grooming traffic to minimize load
DOI10.1016/J.DISC.2011.03.016zbMATH Open1238.68027OpenAlexW2035784055MaRDI QIDQ658091FDOQ658091
Gaetano Quattrocchi, Charles J. Colbourn, Alan C. H. Ling, Violet R. Syrotiuk
Publication date: 11 January 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.03.016
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Optimality conditions for problems involving relations other than differential equations (49K21) Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10)
Cites Work
- Embedding Partial Steiner Triple Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new class of group divisible designs with block size three
- Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven
- Grooming for two-period optical networks
- The SONET edge‐partition problem
- Grooming in unidirectional rings: \(K_{4}-e\) designs
- Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3
- Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming RatioC= 6
- Optical grooming with grooming ratio eight
- Title not available (Why is that?)
- Lower bounds for two-period grooming via linear programming duality
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: Grooming traffic to minimize load
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658091)
