Channel routing of multiterminal nets
From MaRDI portal
Recommendations
Cited in
(25)- Channel routing in a diagonal overlap model
- Maximum \(k\)-covering of weighted transitive graphs with applications
- On the difficulty of Manhattan channel routing
- Routing multiterminal nets on a hexagonal grid
- A near-optimal Manhattan channel router for a class of nets with the shift-right-one pattern
- Diagonal channel routing with vias at unit distance
- Hexagonal three-layer channel routing
- Single-layer channel routing and placement with single-sided nets
- A preliminary study of a diagonal channel-routing model
- scientific article; zbMATH DE number 3898776 (Why is no real title available?)
- scientific article; zbMATH DE number 3907789 (Why is no real title available?)
- scientific article; zbMATH DE number 3967925 (Why is no real title available?)
- scientific article; zbMATH DE number 4077133 (Why is no real title available?)
- Flexible optimal channel routing for critical nets
- scientific article; zbMATH DE number 140125 (Why is no real title available?)
- scientific article; zbMATH DE number 140462 (Why is no real title available?)
- Nearly optimal algorithms and bounds for multilayer channel routing
- scientific article; zbMATH DE number 3893100 (Why is no real title available?)
- An algorithm for routing problems with given horizontal constraint graph
- Transport Channel Selection
- Some polynomially solvable subcases of the detailed routing problem in VLSI design
- Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI
- Optimal multilayer channel routing with overlap
- Multiterminal global routing: A deterministic approximation scheme
- Routing in times square mode
This page was built for publication: Channel routing of multiterminal nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4310845)
