Manhattan Channel Routing is NP-complete Under Truly Restricted Settings
暂无分享,去创建一个
[1] Majid Sarrafzadeh. Channel-Routing Problem in the Knock-Knee Mode Is NP-Complete , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[2] András Frank,et al. Disjoint paths in a rectilinear grid , 1982, Comb..
[3] Joseph JáJá,et al. On the Difficulty of Manhattan Channel Routing , 1992, Inf. Process. Lett..
[4] Thomas Lengauer,et al. Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.
[5] A. S. LaPaugh,et al. ALGORITHMS FOR INTEGRATED CIRCUIT LAYOUT: AN ANALYTIC APPROACH , 1980 .
[6] Thomas G. Szymanski. Dogleg Channel Routing is NP-Complete , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[7] Dorothea Wagner,et al. Routing through a dense channel with minimum total wire length , 1991, SODA '91.