Abstract
For channel routing problems, Deutsch's examples were used extensively as benchmarks for testing new algorithms. However, it is also extremely important to test the performance of channel routing algorithms on a wider variety of difficult examples. In this paper, we present a random channel routing generator which can generate difficult channel routing instances of arbitrary size.
Keywords
VLSI, CAD, channel routing, lower bound, DAG, transitive reduction
Date of this Version
January 1995
COinS