Approximating call-scheduling makespan in all-optical networks

DOI10.1016/J.JDA.2004.04.008MaRDI QIDQ876731zbMATH OpenOpenAlexFDO

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

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 network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 1696518
• Approximation algorithms for routing and call scheduling in all-optical chains and rings.
• scientific article; zbMATH DE number 1500650
• The complexity of path coloring and call scheduling
• Algorithmic Applications in Management

Cites work

• scientific article; zbMATH DE number 47903 (Why is no real title available?)
• scientific article; zbMATH DE number 1256772 (Why is no real title available?)
• scientific article; zbMATH DE number 1263178 (Why is no real title available?)
• scientific article; zbMATH DE number 1107733 (Why is no real title available?)
• scientific article; zbMATH DE number 1500650 (Why is no real title available?)
• scientific article; zbMATH DE number 910915 (Why is no real title available?)
• scientific article; zbMATH DE number 3328106 (Why is no real title available?)
• Efficient delay routing
• Efficient routing in all-optical networks
• On-line routing in all-optical networks
• Optimal wavelength routing on directed fiber trees
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• Scheduling Parallel Machines On-Line
• The complexity of path coloring and call scheduling

Cited in

(2)

• scientific article; zbMATH DE number 1696518 (Why is no real title available?)
• Approximation algorithms for routing and call scheduling in all-optical chains and rings.

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

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