The following pages link to (Q4250198):
Displaying 9 items.
- Lower bounds for two call control problems (Q672266) (← links)
- A preemptive algorithm for maximizing disjoint paths on trees (Q970615) (← links)
- On-line routing of random calls in networks (Q1396752) (← links)
- Scheduling multicasts on unit-capacity trees and meshes. (Q1401961) (← links)
- On-line randomized call control revisited (Q2719132) (← links)
- Distributed online call control on general networks (Q2921742) (← links)
- A Preemptive Algorithm for Maximizing Disjoint Paths on Trees (Q3512469) (← links)
- Greedy online algorithms for routing permanent virtual circuits (Q4267395) (← links)
- On-line competitive algorithms for call admission in optical networks (Q5946121) (← links)