A Provably Good Algorithm for the Two Module Routing Problem
From MaRDI portal
Recommendations
Cited in
(15)- One-layer routing without component constraints
- Global wire routing in two-dimensional arrays
- An efficient one-side height minimization algorithm for routing around a rectangle
- scientific article; zbMATH DE number 1696838 (Why is no real title available?)
- The algorithm and application based on graphs for the symmetrical routing
- An algorithm for the solution of the two-route Johnson problem
- A linear time algorithm for optimal routing around a rectangle
- Two-dimensional stochastic model for interconnections in master slice integrated circuits
- Provably good moat routing
- scientific article; zbMATH DE number 1953174 (Why is no real title available?)
- Probability-driven routing in a datapath environment
- scientific article; zbMATH DE number 946301 (Why is no real title available?)
- Efficient breakout routing in printed circuit boards (extended abstract)
- Graph Drawing
- Optimal algorithms for adjacent side routing
This page was built for publication: A Provably Good Algorithm for the Two Module Routing Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753505)