Approximating call-scheduling makespan in all-optical networks

DOI10.1016/J.JDA.2004.04.008zbMath1118.90050OpenAlexW1995364052MaRDI QIDQ876731

Alberto Marchetti-Spaccamela, Miriam Di Ianni, Luca Becchetti

Publication date: 26 April 2007

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2004.04.008

zbMATH Keywords

schedulingringsoptical networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)

Cites Work

• Efficient delay routing
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• Optimal wavelength routing on directed fiber trees
• Efficient routing in all-optical networks
• On-line routing in all-optical networks
• Scheduling Parallel Machines On-Line
• The complexity of path coloring and call scheduling
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximating call-scheduling makespan in all-optical networks