The following pages link to (Q4259980):
Displaying 5 items.
- On the difficulty of Manhattan channel routing (Q1209358) (← links)
- Switchbox routing in VLSI design: Closing the complexity gap (Q1274317) (← links)
- A near-optimal Manhattan channel router for a class of nets with the shift-right-one pattern (Q1324494) (← links)
- Two-segmented channel routing is strong NP-complete (Q1377673) (← links)
- Some polynomially solvable subcases of the detailed routing problem in VLSI design (Q5954248) (← links)