Nearly optimal algorithms and bounds for multilayer channel routing
From MaRDI portal
Publication:4369873
DOI10.1145/201019.201037zbMATH Open0886.68021OpenAlexW2059322084MaRDI QIDQ4369873FDOQ4369873
Authors: Bonnie Berger, Martin L. Brady, Donna J. Brown, Tom Leighton 
Publication date: 2 February 1998
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/201019.201037
Recommendations
Cited In (26)
- Title not available (Why is that?)
- Channel routing in knock-knee mode: Simplified algorithms and proofs
- A Provably Good Algorithm for the Two Module Routing Problem
- Routing multiterminal nets on a hexagonal grid
- A $1.6$ Approximation Algorithm for Routing Multiterminal Nets
- Title not available (Why is that?)
- The shortest multipaths problem in a capacitated dense channel
- Unconstrained multilayer switchbox routing
- Title not available (Why is that?)
- Some polynomially solvable subcases of the detailed routing problem in VLSI design
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A near-optimal Manhattan channel router for a class of nets with the shift-right-one pattern
- Optimal Rotation Problems in Channel Routing
- Integer Programming and Combinatorial Optimization
- Optimal multilayer channel routing with overlap
- Absolute area approximation in channel routing is NP-hard
- An efficient lower bound algorithm for channel routing
- Optimal Three-Layer Channel Routing
- Title not available (Why is that?)
- A parallel multi-layer channel router on the HVH model
- One-layer routing without component constraints
- A preliminary study of a diagonal channel-routing model
- Channel routing of multiterminal nets
- Multiterminal global routing: A deterministic approximation scheme
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)
