Abstract
We give unified and simplified algorithms and proofs for three results on channel routing in knock-knee mode. LetP be a channel routing problem with densitydmax. (a) [Rivest/Baratz/Miller, Preparata/Lipski]. If all nets inP are two-terminal nets thendmax tracks suffice. (b) [Preparata/Sarrafzadeh]. If all nets inP are two- or three-terminal nets then [3dmax/2] tracks suffice. (c) [Sarrafzadeh/Preparata]. 2dmax-1 tracks always suffice.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
