Theoretical and practical results. Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, and Vijay V. Vazirani. Global wire routing in two-dimensional arrays. Approximations for the disjoint paths problem in high-diameter planar networks. Disjoint paths in densely embedded graphs.
Approximation algorithms for scheduling unrelated parallel machines.
Prabhakar Raghavan and Eli Upfal. Efficient routing in all-optical networks.