论文信息 - Approximation algorithms for VLSI partition problems

Approximation algorithms for VLSI partition problems

Polynomial time approximation algorithms are described for several VLSI partitioning problems, including graph and hypergraph partitioning, and nonplanar edge deletion. The algorithms find solutions that are within a polylogarithmic factor of the optimal solution for several of the problems. All of the algorithms use the Leighton-Rao (7988) graph-separator algorithm as a subroutine.<<ETX>>

Fillia Makedon | Spyros Tragoudas | Tom Leighton

[1] Scott Kirkpatrick,et al. Optimization by simulated annealing: Quantitative studies , 1984 .

[2] Balakrishnan Krishnamurthy,et al. An Improved Min-Cut Algonthm for Partitioning VLSI Networks , 1984, IEEE Transactions on Computers.

[3] Gary L. Miller,et al. Finding small simple cycle separators for 2-connected planar graphs. , 1984, STOC '84.

[4] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[5] Tassos Markas,et al. The Test Engineer's Assistant: a support environment for hardware design for testability , 1989, Computer.

[6] R. M. Mattheyses,et al. A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[7] R. Tarjan,et al. A Separator Theorem for Planar Graphs , 1977 .

[8] Robert E. Tarjan,et al. Application of a Planar Separator Theorem , 1977, FOCS.

[9] Frank Thomson Leighton,et al. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[10] I ScottKirkpatrick. Optimization by Simulated Annealing: Quantitative Studies , 1984 .

[11] Anthony Vannelli,et al. A New Heuristic for Partitioning the Nodes of a Graph , 1988, SIAM J. Discret. Math..

[12] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..