scientific article; zbMATH DE number 1500650

zbMATH Open0953.90031MaRDI QIDQ4501672FDOQ4501672

Authors: Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela 

Publication date: 4 September 2000

Title of this publication is not available (Why is that?)

Recommendations

• Approximation algorithms for routing and call scheduling in all-optical chains and rings.
• Approximating call-scheduling makespan in all-optical networks
• Publication:2766665
• Satisfying a maximum number of pre-routed requests in all-optical rings.
• All-to-all optical routing in chordal rings of degree 4

zbMATH Keywords

networkpolynomial-time approximation schemerouting and scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35)

Cited In (5)

• Approximation algorithms for routing and call scheduling in all-optical chains and rings.
• 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings
• Approximating call-scheduling makespan in all-optical networks
• Title not available (Why is that?)
• Approximable 1-turn routing problems in all-optical mesh networks

This page was built for publication:

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