A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On the bounded-skew clock and Steiner routing problems
1995
Proceedings of the 32nd ACM/IEEE conference on Design automation conference - DAC '95
We study the minimum-cost bounded-skewrouting tree (BST) problem under the linear delay model. This problem captures several engineering tradeoffs in the design of routing topologies with controlled skew. We propose three tradeoff heuristics. (1) For a fixed topology Extended-DME (Ex-DME) extends the DME algorithm for exact zero-skew trees via the concept of a merging region. (2) For arbitrary topology and arbitrary embedding, Extended Greedy-DME (ExG-DME) very closely matches the best known
doi:10.1145/217474.217579
dblp:conf/dac/HuangKT95
fatcat:ycpwtt6qgnan7fv3azfatsxj6u