On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology
From MaRDI portal
Publication:3408178
DOI10.1007/978-3-642-11476-2_22zbMath1274.68692OpenAlexW2153934225MaRDI QIDQ3408178
Shmuel Zaks, Prudence W. H. Wong, Mordechai Shalom
Publication date: 24 February 2010
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11476-2_22
optical networksadd-drop multiplexer (ADM)wavelength division multiplexing (WDM)wavelength assignmentonline matchingmulti-partite graphs
Graph theory (including graph drawing) in computer science (68R10) Online algorithms; streaming algorithms (68W27)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Better bounds for minimizing SONET ADMs
- Traffic partition in WDM/SONET rings to minimize SONET ADMs
- Minimizing ADMs on WDM directed fiber trees
- Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
- Online Weighted Matching
- Optimal Node Routing
- Approximation and Online Algorithms
- Management of multi-queue switches in QoS networks