Nearly optimal algorithms and bounds for multilayer channel routing
From MaRDI portal
Publication:4369873
Recommendations
Cited in
(26)- Channel routing of multiterminal nets
- A parallel multi-layer channel router on the HVH model
- Optimal multilayer channel routing with overlap
- One-layer routing without component constraints
- Absolute area approximation in channel routing is NP-hard
- A near-optimal Manhattan channel router for a class of nets with the shift-right-one pattern
- Multiterminal global routing: A deterministic approximation scheme
- scientific article; zbMATH DE number 1538069 (Why is no real title available?)
- A preliminary study of a diagonal channel-routing model
- Unconstrained multilayer switchbox routing
- An efficient lower bound algorithm for channel routing
- scientific article; zbMATH DE number 1332659 (Why is no real title available?)
- Integer Programming and Combinatorial Optimization
- The shortest multipaths problem in a capacitated dense channel
- Routing multiterminal nets on a hexagonal grid
- scientific article; zbMATH DE number 3893100 (Why is no real title available?)
- Optimal Rotation Problems in Channel Routing
- Channel routing in knock-knee mode: Simplified algorithms and proofs
- Optimal Three-Layer Channel Routing
- scientific article; zbMATH DE number 1786525 (Why is no real title available?)
- scientific article; zbMATH DE number 6538149 (Why is no real title available?)
- A $1.6$ Approximation Algorithm for Routing Multiterminal Nets
- A Provably Good Algorithm for the Two Module Routing Problem
- scientific article; zbMATH DE number 3898776 (Why is no real title available?)
- scientific article; zbMATH DE number 3907789 (Why is no real title available?)
- Some polynomially solvable subcases of the detailed routing problem in VLSI design
This page was built for publication: Nearly optimal algorithms and bounds for multilayer channel routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4369873)
