scientific article; zbMATH DE number 4083048

MaRDI QIDQ3813339zbMATH OpenFDO

Authors Shaodi Gao, Michael Kaufmann, K. Mehlhorn, Wolfgang Rülling, Christoph Storb, Mark Jerrum

Publication date 1988

zbMATH Keywords

computational geometryhomotopic one-layer routingVLSI layout

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99)

Recommendations

• Homotopic \(\mathcal{C}\)-oriented routing
• On the computational complexity of continuous routing
• scientific article; zbMATH DE number 4211829
• Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges
• Homotopic Rectilinear Routing with Few Links and Thick Edges
• One-layer routing without component constraints
• scientific article; zbMATH DE number 1863317
• Optimal many-to-one routing on the mesh with constant queues
• scientific article; zbMATH DE number 6025258

Cited in

(8)

• Routing and timetabling by topological search
• Parity conditions in homotopic knock-knee routing
• Computing homotopic shortest paths efficiently
• Homotopic Rectilinear Routing with Few Links and Thick Edges
• scientific article; zbMATH DE number 1234989 (Why is no real title available?)
• A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs
• Shortest polygonal paths in space
• A generic algorithm for one-dimensional homotopic compaction

This page was built for publication:

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