Publication:4373682
From MaRDI portal
zbMath0890.68017MaRDI QIDQ4373682
Erlebach, Thomas, Klaus Jansen
Publication date: 23 June 1998
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
The complexity of path coloring and call scheduling, Approximating call-scheduling makespan in all-optical networks, 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