Routing through a Dense Channel with Minimum Total Wire Length

DOI10.1006/JAGM.1993.1041MaRDI QIDQ3141533zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

channel routingknock-knee modelayout problemminimum arearouting areawire length

Mathematics Subject Classification ID

Circuits, networks (94C99)

Recommendations

• OPTIMAL ROUTING THROUGH DENSE CHANNELS
• scientific article; zbMATH DE number 1737512
• Optimal Three-Layer Channel Routing
• scientific article; zbMATH DE number 4118301
• scientific article; zbMATH DE number 3907789

Cited in

(15)

• An efficient parallel logarithmic time algorithm for the channel routing problem
• 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
• Finding all minimal shapes in a routing channel
• Optimizing area for three-layer knock-knee channel routing
• Optimum path packing on wheels: The consecutive case
• Flexible optimal channel routing for critical nets
• OPTIMAL ROUTING THROUGH DENSE CHANNELS
• scientific article; zbMATH DE number 4118301 (Why is no real title available?)
• Fast algorithms for one-dimensionsal compaction with jog insertion
• Switchbox routing in VLSI design: closing the complexity gap (extended abstract)
• Minimizing channel density with movable terminals
• The shortest multipaths problem in a capacitated dense channel
• 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

This page was built for publication: Routing through a Dense Channel with Minimum Total Wire Length

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3141533)