We present a new &Ogr;(n2) heuristic for hypergraph min-cut bipartitioning, an important problem in circuit placement. Fastest previous methods for this problem are &Ogr;(n2 log n). Our approach is based on the intersection graph G dual to the input hypergraph. Paths in G are used to construct partial bipartitions which can be completed optimally. The method is provably good and, in particular, obtains optimum results for "difficult" inputs, i.e., hypergraphs with smaller than expected minimum cutsize. Computational results for a wide range of inputs are also discussed.
展开▼
机译：
我们提出了一种新的＆Ogr;（ n 2 ）用于超图最小切割分割的启发式方法，这是电路布局中的一个重要问题。解决此问题的最快方法是＆Ogr;（ n 2 log n ）。我们的方法基于与输入超图对偶的相交图G 。 G 中的路径用于构建可以最佳完成的 partial 分区。该方法被证明是良好的，并且特别是对于“困难”的输入，即具有小于预期最小切割尺寸的超图，获得了最佳结果。还讨论了各种输入的计算结果。
