Original Paper: "Secure Routing for Mobile Ad hoc Networks"
"Channel routing plays a central role in the physical design of VLSI chips. For two-layer dogleg-free channel routing, dmax and vmax are the two traditional lower bounds. In this paper, we present two efficient algorithms for computing a tighter lower bound for the channel routing problem. Our algorithms successfully compute a lower bound of 26 for Deutsch's Difficult Example (DDE). The experiment on some large-scale randomly generated channel routing problems shows that our lower bound algorithms are much tighter than the traditional lower bounds, and are much more efficient than Pals' algorithm while obtaining similar (sometimes better) results."
| Previous Slide | 12 of 15 | Next Slide |