The following pages link to (Q4527032):
Displaying 16 items.
- The impact of local policies on the quality of packet routing in paths, trees, and rings (Q835620) (← links)
- Atomic routing games on maximum congestion (Q838146) (← links)
- Efficient delay routing (Q1128715) (← links)
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps (Q1330796) (← links)
- Adaptive packet routing for bursty adversarial traffic (Q1577008) (← links)
- Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules (Q1964594) (← links)
- Direct routing: Algorithms and complexity (Q2369874) (← links)
- Scheduling problems in transportation networks of line topology (Q2448158) (← links)
- A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria (Q2719123) (← links)
- Near-optimal scheduling of distributed algorithms (Q2796236) (← links)
- Universal Packet Routing with Arbitrary Bandwidths and Transit Times (Q3009776) (← links)
- Survey on Oblivious Routing Strategies (Q3576074) (← links)
- Oblivious Routing for Sensor Network Topologies (Q5391122) (← links)
- Bounding Residence Times for Atomic Dynamic Routings (Q5870375) (← links)
- On the benefit of supporting virtual channels in wormhole routers (Q5943124) (← links)
- Two exact algorithms for the packet scheduling problem (Q6606173) (← links)
