Approximation algorithms for constructing wavelength routing networks

DOI10.1002/NET.10036MaRDI QIDQ4785217zbMATH OpenOpenAlexFDO

Authors Refael Hassin, Asaf Levin

Publication date 17 December 2002

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.10036

zbMATH Keywords

network synthesiswavelength routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Recommendations

• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings
• Near optimal design of wavelength routed optical networks
• Inapproximability results for wavelength assignment in WDM optical networks
• scientific article; zbMATH DE number 1163711
• A memetic algorithm to schedule planned maintenance for the national grid
• Solving routing and wavelength assignment problem with maximum edge-disjoint paths
• STACS 2004

Cited in

(7)

• Wavelength rerouting in optical networks, or the Venetian Routing problem
• 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings
• A memetic algorithm to schedule planned maintenance for the national grid
• Efficient algorithms for wavelength assignment on trees of rings
• scientific article; zbMATH DE number 1670531 (Why is no real title available?)
• Variable neighborhood descent with iterated local search for routing and wavelength assignment
• Optimization in telecommunication networks

This page was built for publication: Approximation algorithms for constructing wavelength routing networks

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