Israel Cederbaum

Learn 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