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). >

[1]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[2]  András Frank,et al.  Disjoint paths in a rectilinear grid , 1982, Comb..

[3]  Sumio Masuda,et al.  The Via Minimization Problem is NP-Complete , 1989, IEEE Trans. Computers.

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Kurt Mehlhorn,et al.  On Local Routing of Two-Terminal Nets , 1987, STACS.

[6]  Sartaj Sahni,et al.  Single Bend Wiring , 1986, J. Algorithms.

[7]  Dana S. Richards,et al.  Complexity of Single-Layer Routing , 1984, IEEE Transactions on Computers.

[8]  Kurt Mehlhorn,et al.  Routing through a rectangle , 1986, JACM.

[9]  Kurt Mehlhorn,et al.  Routing Through a Generalized Switchbox , 1986, J. Algorithms.