Optimal on-line colorings for minimizing the number of ADMs in optical networks
From MaRDI portal
Publication:972358
DOI10.1016/J.JDA.2009.02.006zbMATH Open1186.90120OpenAlexW2043278341MaRDI QIDQ972358FDOQ972358
Authors: Mordechai Shalom, Shmuel Zaks, Prudence W. H. Wong
Publication date: 25 May 2010
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2009.02.006
Recommendations
- Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
- On minimizing the number of ADMs in a general topology optical network
- On Minimizing the Number of ADMs in a General Topology Optical Network
- scientific article
- On-line maximum matching in complete multi-partite graphs with an application to optical networks
- STACS 2004
- On the complexity of approximation and online scheduling problems with applications to optical networks
- On-line competitive algorithms for call admission in optical networks
- On-line competitive algorithms for call admission in optical networks
- Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing
on-line algorithmsoptical networksadd-drop multiplexer (ADM)wavelength division multiplexing (WDM)wavelength assignment
Cites Work
Cited In (12)
- On minimizing the number of ADMs in a general topology optical network
- Approximation and Online Algorithms
- On the complexity of approximation and online scheduling problems with applications to optical networks
- Scheduling light-trails on WDM rings
- On-line routing in all-optical networks
- On-line maximum matching in complete multi-partite graphs with an application to optical networks
- On Minimizing the Number of ADMs – Tight Bounds for an Algorithm Without Preprocessing
- On Minimizing the Number of ADMs in a General Topology Optical Network
- Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
- On-line routing in all-optical networks
- On-line maximum matching in complete multipartite graphs with implications to the minimum ADM problem on a star topology
- Title not available (Why is that?)
This page was built for publication: Optimal on-line colorings for minimizing the number of ADMs in optical networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972358)