On minimizing the number of ADMs--tight bounds for an algorithm without preprocessing

DOI10.1016/J.JPDC.2006.12.002MaRDI QIDQ878685zbMATH OpenOpenAlexFDO

Authors Michele Flammini, Mordechai Shalom, Shmuel Zaks

Publication date 26 April 2007

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2006.12.002

zbMATH Keywords

add-drop multiplexer (ADM)optical networkswavelength assignmentwavelength division multiplexing (WDM)

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• On Minimizing the Number of ADMs – Tight Bounds for an Algorithm Without Preprocessing
• Approximation and Online Algorithms
• Better bounds for minimizing SONET ADMs
• Minimal strong admissibility: a complexity analysis
• A polynomial lower bound on adaptive complexity of submodular maximization
• Asymptotically tight worst case complexity bounds for initial-value problems with nonadaptive information
• A lower bound for nearly minimal adaptive and hot potato algorithms
• A lower bound for nearly minimal adaptive and hot potato algorithms
• On approximation algorithms for the minimum satisfiability problem

Cited in

(7)

• Minimization of SONET ADMs in ring networks revisited
• On equilibria for ADM minimization games
• 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
• Hardness and inapproximability of minimizing adaptive distinguishing sequences
• 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

This page was built for publication: On minimizing the number of ADMs--tight bounds for an algorithm without preprocessing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878685)