Abstract
The author investigates the two-terminal L-shaped channel routing problem (LRP) in the knock-knee diagonal model (KKD), where the grid consists of right and left tracks displayed at +45 degrees and -45 degrees . An optimal routing algorithm for the two-terminal simple LRP in KDD, which generates solutions matching the lower bound is presented. >
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 callMore From: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Paper Title
Journal
Date
