Routing through a generalized switchbox

DOI10.1016/0196-6774(86)90016-7MaRDI QIDQ3768418zbMATH OpenOpenAlexFDO

Authors Michael Kaufmann, K. Mehlhorn

Publication date 1986

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(86)90016-7

zbMATH Keywords

generalized switchbox routing problemstwo-terminal nets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 3932954
• Optimal algorithms for adjacent side routing
• Routing in polygons without rectilinearly visible corners
• scientific article; zbMATH DE number 1288324
• Algorithms for routing around a rectangle

Cited in

(22)

• Algorithms for routing in planar graphs
• Parity conditions in homotopic knock-knee routing
• Routing in polygons without rectilinearly visible corners
• On local routing of two-terminal nets
• A linear-time algorithm for edge-disjoint paths in planar graphs
• Additive approximation for layer minimization of Manhattan switchbox routing
• Edge-disjoint routing in plane switch graphs in linear time.
• scientific article; zbMATH DE number 3932954 (Why is no real title available?)
• Routing Multiterminal Nets Around a Rectangle
• scientific article; zbMATH DE number 4039320 (Why is no real title available?)
• scientific article; zbMATH DE number 4051669 (Why is no real title available?)
• On the routability of a convex grid
• Peel-the-box: a concept of switch-box routing and tractable problems
• Provably good moat routing
• scientific article; zbMATH DE number 1288324 (Why is no real title available?)
• scientific article; zbMATH DE number 1941066 (Why is no real title available?)
• Routing in grid graphs by cutting planes
• DRAWING WITH FAT EDGES
• Finding edge-disjoint paths in partial k-trees
• Switchbox routing in VLSI design: closing the complexity gap (extended abstract)
• Optimal algorithms for adjacent side routing
• Edge-disjoint paths in a grid bounded by two nested rectangles

This page was built for publication: Routing through a generalized switchbox

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