Min-Cost Partitioning on a Tree Structure and Applications

@article{Vijayan1989MinCostPO,
title={Min-Cost Partitioning on a Tree Structure and Applications},
author={Gopalakrishnan Vijayan},
journal={26th ACM/IEEE Design Automation Conference},
year={1989},
pages={771-774}
}

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 the vertices of a tree structure <italic>T</italic>, and the cost function to be minimized is the cost of routing the hyperedges (i.e., the nets) of <italic>G</italic> on the edges of <italic>T</italic>. We discuss several interesting VLSI design applications for this problem. We describe an iterative… CONTINUE READING