The following pages link to (Q4373682):
Displayed 5 items.
- Approximating call-scheduling makespan in all-optical networks (Q876731) (← links)
- Approximation algorithms for routing and call scheduling in all-optical chains and rings. (Q1853488) (← links)
- Randomized path coloring on binary trees. (Q1853533) (← links)
- A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree (Q2185817) (← links)
- The complexity of path coloring and call scheduling (Q5941061) (← links)