scientific article; zbMATH DE number 1107733

zbMath0890.68017MaRDI QIDQ4373682

Erlebach, Thomas, Klaus Jansen

Publication date: 23 June 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

list-schedulingcall-scheduling

Mathematics Subject Classification ID

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

Related Items (5)

Approximating call-scheduling makespan in all-optical networks ⋮ A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree ⋮ The complexity of path coloring and call scheduling ⋮ Approximation algorithms for routing and call scheduling in all-optical chains and rings. ⋮ Randomized path coloring on binary trees.

This page was built for publication: