scientific article; zbMATH DE number 1500650

MaRDI QIDQ4501672zbMATH OpenFDO

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

Publication date 4 September 2000

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)

Recommendations

• Approximation algorithms for routing and call scheduling in all-optical chains and rings.
• Approximating call-scheduling makespan in all-optical networks
• scientific article; zbMATH DE number 1696518
• Satisfying a maximum number of pre-routed requests in all-optical rings.
• All-to-all optical routing in chordal rings of degree 4

Cited in

(5)

• Approximable 1-turn routing problems in all-optical mesh networks
• scientific article; zbMATH DE number 1696518 (Why is no real title available?)
• Approximating call-scheduling makespan in all-optical networks
• 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings
• Approximation algorithms for routing and call scheduling in all-optical chains and rings.

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)