We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in our approach is toâ€¦ (More)

We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in our approach is toâ€¦ (More)

The embedding problem for a class of graphs called rectilinear graphs is discussed. These graphs have applications in many VLSI Layout Problems. An interesting topological characterization of theseâ€¦ (More)

1997 Proceedings of IEEE International Conferenceâ€¦

1997

Traditional synthesis techniques optimize CMOS circuits in two phases: i) logic minimization and ii) library mapping phase. Typically, the structures and the sizes of the gates in the library areâ€¦ (More)

We introduce a generalization of the min-cut partitioning problem, called <italic>Min-Cost Tree Partitioning</italic>, in which the nodes of an hypergraph <italic>G</italic> are to be mapped on toâ€¦ (More)

We investigate the layer assignment problem that arises in the design of a multichip module (MCM), which is a high performance compact package for the interconnection of several hundred chips. Theâ€¦ (More)