论文信息 - A Simple Approximation Algorithm for Two Problems in Circuit Design

A Simple Approximation Algorithm for Two Problems in Circuit Design

This paper provides a very simple two-approximation algorithm for two NP-hard problems that arise in electronic circuit design. To our knowledge, this is the best approximation bound known for these problems. In addition, the simplicity of the proposed algorithm makes it attractive for real-time applications for similar problems in areas such as telecommunications and parallel processing.

Joseph L. Ganley | Iraj Saniee | Steven Cosares | Tamra Carpenter

[1] Tamra J. Carpenter,et al. Demand Routing and Slotting on Ring Networks , 1997 .

[2] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .

[3] Teofilo F. Gonzalez,et al. A 1.6 Approximation Algorithm for Routing Multiterminal Nets , 1987, SIAM J. Comput..

[4] Majid Sarrafzadeh,et al. A bottom-up layout technique based on two-rectangle routing , 1987, Integr..

[5] Haruko Okamura,et al. Multicommodity flows in planar graphs , 1981, J. Comb. Theory, Ser. B.

[6] Joseph L. Ganley,et al. Minimum-Congestion Hypergraph Embedding in a Cycle , 1997, IEEE Trans. Computers.

[7] Teofilo F. Gonzalez,et al. A linear time algorithm for optimal routing around a rectangle , 1988, JACM.

[8] Kuo-Feng Liao,et al. Planar Routing around a Rectangle , 1992, J. Circuits Syst. Comput..

[9] Nobuji Saito,et al. Algorithms for Routing around a Rectangle , 1992, Discret. Appl. Math..

[10] Joseph L. Ganley,et al. A provably good moat routing algorithm , 1996, Proceedings of the Sixth Great Lakes Symposium on VLSI.