3 search results - page 1 / 1 » Approximation Algorithms for Routing and Call Scheduling in ... |
FSTTCS
1999
Springer
13 years 9 months ago
1999
Springer
INFOCOM
2003
IEEE
13 years 10 months ago
2003
IEEE
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...
SPAA
1999
ACM
13 years 9 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...