Routing through a Dense Channel with Minimum Total Wire Length
From MaRDI portal
Publication:3141533
DOI10.1006/jagm.1993.1041zbMath0778.94012OpenAlexW2048444823MaRDI QIDQ3141533
No author found.
Publication date: 6 December 1993
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1993.1041
Related Items
The shortest multipaths problem in a capacitated dense channel ⋮ Optimizing area for three-layer knock-knee channel routing ⋮ Optimum path packing on wheels: The consecutive case ⋮ Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs ⋮ Exact and approximate resolution of integral multiflow and multicut problems: Algorithms and complexity ⋮ Switchbox routing in VLSI design: Closing the complexity gap ⋮ A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works