Browsing by Subject "Greedy algorithms"
Now showing items 1-1 of 1
-
Article
Direct routing: Algorithms and complexity
(2004)Direct routing is the special case of bufferless routing where N packets, once injected into the network, must be routed along specific paths to their destinations without conflicts. We give a general treatment of three ...