River routing in VLSI (Q1102106): Difference between revisions

The main result of this well written and interesting paper is an O(n) time algorithm for the optimum offset problem in single-layer river routing. The result is achieved using a halving technique which is claimed to be new, but is merely a variant of the old divide-and-conquer paradigm. Algorithms for the minimum area, minimum longest wire length and minimum total wire length problems are also given that take \(O(n^ 2)\) time.