Peel-the-box: a concept of switch-box routing and tractable problems

DOI10.1016/0167-9260(92)90009-NzbMATH Open0756.68054OpenAlexW2082673538MaRDI QIDQ4015490FDOQ4015490

Authors: Atsushi Takahashi, Yoji Kajitani 

Publication date: 13 January 1993

Published in: Integration (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-9260(92)90009-n

Recommendations

• scientific article; zbMATH DE number 1288324
• Switchbox routing in VLSI design: Closing the complexity gap
• A branch-and-price algorithm for switch-box routing
• Improving size-bounds for subcases of square-shaped switchbox routing
• Routing through a generalized switchbox
• scientific article; zbMATH DE number 3932954
• Unconstrained multilayer switchbox routing
• On the optimal four-way switch box routing structures of FPGA greedy routing architectures
• Additive approximation for layer minimization of Manhattan switchbox routing

zbMATH Keywords

2-layer switch-boxBOX- PEELERLEFT-EDGE-ROUTERpolynomial routertractable switch-boxes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (3)

• Switchbox routing in VLSI design: Closing the complexity gap
• Traveling with a Pez Dispenser (or, Routing Issues in MPLS)
• Title not available (Why is that?)

This page was built for publication: Peel-the-box: a concept of switch-box routing and tractable problems

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