Switchbox routing in VLSI design: Closing the complexity gap
type: Item
instance of: scholarly article
title: Switchbox routing in VLSI design: Closing the complexity gap
zbMATH Open document ID: 0913.68101
DOI: 10.1016/S0304-3975(97)00286-7
author: Stephan Hartmann
author: Markus W. Schäffter
author: Andreas S. Schulz
published in: Theoretical Computer Science
publication date: 1999-01-12T00:00:00Z
Mathematics Subject Classification ID: 68W35
Mathematics Subject Classification ID: 68M99
zbMATH DE Number: 1238334
zbMATH Keywords: VLSI design
zbMATH Keywords: switchbox routing
zbMATH Keywords: NP-completeness
zbMATH Keywords: Steiner tree packing
MaRDI profile type: Publication
cites work: Routing through a Dense Channel with Minimum Total Wire Length
cites work: Q4198056
cites work: Routing in grid graphs by cutting planes
cites work: Q3210200
cites work: Q3997942
cites work: Q4259980
cites work: Q5687199
cites work: Multicommodity flows in planar graphs
full work available at URL: s0304-3975(97)00286-7
OpenAlex ID: W1849307453
Recommended article: Algorithms and Computation
Recommended article: On routing in VLSI design and communication networks
Recommended article: Routing in VLSI-layout
Recommended article: On the optimal four-way switch box routing structures of FPGA greedy routing architectures
Recommended article: VLSI routing in polynomial time
Recommended article: Global routing in VLSI design: algorithms, theory, and computational practice
Recommended article: Peel-the-box: a concept of switch-box routing and tractable problems
description: scientific article; zbMATH DE number 1238334