1. Adler M, Khanna S, Rajaraman R, Rosén A (2003) Timeconstrained scheduling of weighted packets on trees and meshes. Algorithmica 36:123–152
2. Alon N, Chung F, Graham R (1994) Routing permutations on graphs via matching. SIAM J Discret Math 7(3):513–530
3. Alstrup S, Holm J, de Lichtenberg K, Thorup M (1998) Direct routing on trees. In: Proceedings of the ninth annual ACM-SIAM, symposium on discrete algorithms (SODA 98), San Francisco, pp 342–349
4. Ben-Dor A, Halevi S, Schuster A (1998) Potential function analysis of greedy hot-potato routing. Theory Comput Syst 31(1):41–61
5. Busch C, Herlihy M, Wattenhofer R (2000) Hard-potato routing. In: Proceedings of the 32nd annual ACM symposium on theory of computing, Portland, pp 278–285