Pages that link to "Item:Q5712463"
From MaRDI portal
The following pages link to Integer Programming and Combinatorial Optimization (Q5712463):
Displaying 11 items.
- A provably tight delay-driven concurrently congestion mitigating global routing algorithm (Q299423) (← links)
- Faster min-max resource sharing in theory and practice (Q542051) (← links)
- A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem (Q845550) (← links)
- Optimal wire ordering and spacing in low power semiconductor design (Q847831) (← links)
- Multiterminal global routing: A deterministic approximation scheme (Q916369) (← links)
- Packing trees in communication networks (Q1016048) (← links)
- A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing (Q1044022) (← links)
- SSTT: Efficient local search for GSI global routing (Q1412147) (← links)
- CNB: a critical-network-based timing optimization method for standard cell global routing (Q1884304) (← links)
- A combinatorial congestion estimation approach with generalized detours (Q2475902) (← links)
- (Q5020877) (← links)