Approximating call-scheduling makespan in all-optical networks

DOI10.1016/J.JDA.2004.04.008zbMATH Open1118.90050OpenAlexW1995364052MaRDI QIDQ876731FDOQ876731

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

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

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)

Cites Work

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

Cited In (2)

• Approximation algorithms for routing and call scheduling in all-optical chains and rings.
• Title not available (Why is that?)

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)