1. M. Formann, D. Wagner, and F. Wagner. Routing through a dense channel with minimum total wire length. Journal of Algorithms, 15:267–283, 1993.
2. M. R. Garey and D. S. Johnson. Computers and Intractability — A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.
3. M. Grötschel, A. Martin, and R. Weismantel. Routing in grid graphs by cutting planes. In G. Rinaldi and L. Wolsey, editors, Third IPCO Conference, pages 447–461, 1993.
4. S. Hartmann. Channel routing with 4-terminal nets is NP-complete. Preprint, Fachbereich Mathematik, Technische Universität Berlin, Berlin, Germany, 1996.
5. B. Korte, H.-J. Prömel, and A. Steger. Steiner trees in VLSI-layout. In B. Korte, L. Lovasz, H. J. Prömel, and A. Schrijver, editors, Paths, Flows and VLSI-Layout, pages 185–214. Springer Verlag, 1990.