On multiterminal single bend wirability

In a paper by Raghavan, Cohoon, and Sahni (see J. Algorithms, vol. 7, p. 232-57, 1986), the single layer single bend wirability problem has been shown to be solvable in polynomial time for two-terminal nets. In this paper, we investigate the problem for a slightly generalized model in which nets are allowed to have two or more terminals. We show that for multiterminal nets, the single bend wirability problem becomes NP-complete, even when all wires are 'short' (i.e. of fixed length).<
>