Pages that link to "Item:Q3558928"
From MaRDI portal
The following pages link to Packet Routing: Complexity and Algorithms (Q3558928):
Displaying 20 items.
- On the complexity of quality of service routing (Q294629) (← links)
- Computational complexity of convoy movement planning problems (Q494695) (← links)
- The generalized packet routing problem (Q580964) (← links)
- Scheduling trains with small stretch on a unidirectional line (Q831686) (← links)
- Efficient delay routing (Q1128715) (← links)
- Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules (Q1964594) (← links)
- Multiple train repositioning operations in a railyard network (Q2084317) (← links)
- Scheduling problems over a network of machines (Q2281619) (← links)
- Direct routing: Algorithms and complexity (Q2369874) (← links)
- Routing equal-size messages on a slotted ring (Q2434298) (← links)
- A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria (Q2719123) (← links)
- Universal Packet Routing with Arbitrary Bandwidths and Transit Times (Q3009776) (← links)
- Packet Routing on the Grid (Q3557014) (← links)
- Package routing in transportation networks with fixed vehicle schedules (Q4887737) (← links)
- Scheduling Problems over Network of Machines (Q5002605) (← links)
- Train Scheduling on a Unidirectional Path (Q5136321) (← links)
- Algorithms – ESA 2004 (Q5464573) (← links)
- Bounding Residence Times for Atomic Dynamic Routings (Q5870375) (← links)
- Two exact algorithms for the packet scheduling problem (Q6606173) (← links)
- Network routing on regular digraphs and their line graphs (Q6657884) (← links)