scientific article; zbMATH DE number 1107733

MaRDI QIDQ4373682zbMATH OpenFDO

Authors Thomas Erlebach, Klaus Jansen

Publication date 23 June 1998

zbMATH Keywords

call-schedulinglist-scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 1696518
• Approximating call-scheduling makespan in all-optical networks
• scientific article; zbMATH DE number 1003262
• Efficient On-Line Call Control Algorithms

Cited in

(8)

• Approximation algorithms for routing and call scheduling in all-optical chains and rings.
• Randomized path coloring on binary trees.
• A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree
• COMPUTING CALL ADMISSION CAPACITIES IN LINEAR NETWORKS
• The complexity of path coloring and call scheduling
• Lower bounds for two call control problems
• Approximation algorithms for round-UFP and round-SAP
• Approximating call-scheduling makespan in all-optical 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 Q4373682)