#### Filter Results:

#### Publication Year

1988

1993

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

The building blocks in a given floorplan may have several possible physical implementations yielding different layouts. This paper discusses the problem of selecting an optimal implementation for each building block so that the area of the final layout is minimized. A polynomial algorithm that solves this problem for slicing floorplans was presented… (More)

The problem of finding the path having the smallest average arc length in an acyclic digraph with a single source and a single sink is considered in this paper. This problem arises in VLSI block placement procedures when spreading the building blocks uniformly over the chip area is attempted. A well-known approximation algorithm to find the path with the… (More)

- ‹
- 1
- ›