Optimizing regenerator cost in traffic grooming
From MaRDI portal
Publication:655419
DOI10.1016/J.TCS.2011.09.023zbMATH Open1229.90032OpenAlexW2165377422MaRDI QIDQ655419FDOQ655419
Authors: Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks 
Publication date: 4 January 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.09.023
Recommendations
- On the complexity of the regenerator cost problem in general networks with traffic grooming
- Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
- Online regenerator placement
- Approximation algorithms for grooming in optical network design
- Approximating the traffic grooming problem
Cites Work
- Paths, Trees, and Flowers
- The regenerator location problem
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- Traffic partition in WDM/SONET rings to minimize SONET ADMs
- Approximating the traffic grooming problem in tree and star networks
- Title not available (Why is that?)
- Minimizing total busy time in parallel scheduling with application to optical networks
- Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
- Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
Cited In (5)
- On the complexity of the regenerator location problem treewidth and other parameters
- Minimizing total busy time in parallel scheduling with application to optical networks
- LP rounding and combinatorial algorithms for minimizing active and busy time
- Online regenerator placement
- On the complexity of the regenerator cost problem in general networks with traffic grooming
This page was built for publication: Optimizing regenerator cost in traffic grooming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q655419)
