Abstract
In this paper we describe a deterministic algorithm for solving any 1---1 packet-routing problem on ann ×n mesh in 2nź2 steps using constant-size queues. The time bound is optimal in the worst case. The best previous deterministic algorithm for this problem required time 2n+ź(n/q) using queues of size ź(q) for any 1≤q≤n, and the best previous randomized algorithm required time 2n+ź(logn) using constant-size queues.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
