A provably tight delay-driven concurrently congestion mitigating global routing algorithm
From MaRDI portal
Recommendations
Cites work
Cited in
(10)- SSTT: Efficient local search for GSI global routing
- CNB: a critical-network-based timing optimization method for standard cell global routing
- Knapsack problem with objective value gaps
- A combinatorial congestion estimation approach with generalized detours
- A provably tight delay-driven concurrently congestion mitigating global routing algorithm
- Congestion estimation for hexagonal routing
- A survey on multi-net global routing for integrated circuits
- Probability-driven routing in a datapath environment
- Integer Programming and Combinatorial Optimization
- Maximal delay reduction for RLC-based multi-source multi-sink bus with repeater insertion
This page was built for publication: A provably tight delay-driven concurrently congestion mitigating global routing algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q299423)