Pages that link to "Item:Q3141533"
From MaRDI portal
The following pages link to Routing through a Dense Channel with Minimum Total Wire Length (Q3141533):
Displaying 12 items.
- Minimizing channel density with movable terminals (Q675304) (← links)
- The shortest multipaths problem in a capacitated dense channel (Q859708) (← links)
- Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs (Q924540) (← links)
- Exact and approximate resolution of integral multiflow and multicut problems: Algorithms and complexity (Q926573) (← links)
- An efficient parallel logarithmic time algorithm for the channel routing problem (Q1201820) (← links)
- Switchbox routing in VLSI design: Closing the complexity gap (Q1274317) (← links)
- A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works (Q1304467) (← links)
- Finding all minimal shapes in a routing channel (Q1387837) (← links)
- Optimizing area for three-layer knock-knee channel routing (Q1913703) (← links)
- Optimum path packing on wheels: The consecutive case (Q1921239) (← links)
- Fast algorithms for one-dimensionsal compaction with jog insertion (Q5060150) (← links)
- Switchbox routing in VLSI design: closing the complexity gap (extended abstract) (Q6550545) (← links)
