Pages that link to "Item:Q2369874"
From MaRDI portal
The following pages link to Direct routing: Algorithms and complexity (Q2369874):
Displaying 11 items.
- Direct \(k\)-routing versus cross-docking: worst-case results (Q2037884) (← links)
- The network as a storage device: dynamic routing with bounded buffers (Q2391188) (← links)
- Efficient bufferless packet switching on trees and leveled networks (Q2455398) (← links)
- Nonmonotonic phenomena in packet routing (Q2819590) (← links)
- Universal Packet Routing with Arbitrary Bandwidths and Transit Times (Q3009776) (← links)
- Packet Routing: Complexity and Algorithms (Q3558928) (← links)
- Directional Routing via Generalized <i>st</i>-Numberings (Q4490784) (← links)
- Algorithms – ESA 2004 (Q5464573) (← links)
- Approximation and Online Algorithms (Q5713441) (← links)
- Bounding Residence Times for Atomic Dynamic Routings (Q5870375) (← links)
- The non-stop disjoint trajectories problem (Q6564192) (← links)