An algorithm for finding a non-trivial lower bound for channel routing
Citations
5 citations
4 citations
3 citations
2 citations
Cites background or methods from "An algorithm for finding a non-triv..."
...This paper emphasizes on finding a better nontrivial lower bound than the earlier deterministic algorithm [9]....
[...]
...Theorem 1: MIMETIC_LBOUND computes exact lower bound on the number of track requirement to route a channel, and result is better or at least equal to that found using LOWER_BOUND algorithm [9]....
[...]
...Channel instance dmax vmax max(dmax, vmax) Lbound by our algorithm CPU time Best solution known [9] CH1 4 4 4 6 0....
[...]
...The deterministic version of computing a nontrivial lower bound is presented in [9], that took time Ο(n) for a channel of n nets....
[...]
...MIMETIC_LBOUND also provides result as good as earlier computed lower bound for Deutsch’s difficult example (DDE) [9]....
[...]
1 citations
References
4,090 citations
655 citations
539 citations
209 citations
105 citations