Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules

• 1 March 1999
• journal article
• Published by Springer Nature in Combinatorica
• Vol. 19  (3) , 375-401
• https://doi.org/10.1007/s004930050061

Abstract

Keywords

• DILATION
• QUEUES
• CONGESTION
• SCHEDULES
• EDGES
• PACKET
• LONGEST
• SUM
• DISCOVERED
• TAKEN