Hierarchical Routing(Burstein & Pelavin)

1

4

6

1

7

8

4

9

10

10

3

2

5

2

6

9

8

7

9

3

5

5

Cij

Vij

Hij

i

j

Top t(j)

Bottom b(j)

C(i,j) rectilinear channel grid, i=1,2,…,m; j=1,2,…,n

0 ? W(Hij) ? 1, W(Vkj)=0, k=1,m, j=1,…,n

Previous slide

Next slide

Back to first slide

View graphic version