- Full text PDF available (4)
- This year (0)
- Last five years (0)
From the passanger's point of view, one of the most important property of an attractive public railway company is punctuality. Passangers, buying a train ticket, expect that they maintain their connections and reach their destination in time as scheduled. But unexpected occurences cause disturbances even in the most carefully designed network. Boarding of… (More)
In this paper we introduce a exible software framework for the easy implementation and evaluation of VLSI routing algorithms and the visualization of routing results. Moreover, we present some new results in the theory of VLSI routing algorithms for rectangular grids, as well as the reformulation of some classical algorithms for triangular grids.
Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Each copy of any part of a JSTOR transmission must contain the same copyright notice that… (More)
We show that, for a single row routing specification with maximum density d, the difference between [d/2] and the real lower bound of the minimum width in the unconstrained two-layer routing can be as high as a positive percentage of d. One of the simplest questions in the theory of the detailed routing of very large scale integrated circuits (VLSI) is to… (More)