Minimum-congestion hypergraph embedding in a cycle

IEEE Transactions on Computers

Volumn 46, Issue 5, 1997, Pages 600-602

  Ganley, Joseph L ^a   Cohoon, James P ^b,c  

^a CADENCE DESIGN SYSTEMS   (United States)

^b University of Virginia   (United States)

^c IEEE   (United States)

Author keywords

Approximation algorithms; Congestion; Hypergraph embedding in a cycle; Moat routing; NP completeness; Ring routing; Routing around a rectangle

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY;

COMPUTER ROUTING; MINIMUM CONGESTION HYPERGRAPH EMBEDDING IN A CYCLE (MCHEC);

COMPUTER NETWORKS;

EID: 0031379982     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.589233     Document Type: Article

References (13)

1. A. Frank, T. Nishizeki, N. Saito, H. Suzuki, and É. Tardos, "Algorithms for Routing Around a Rectangle," Discrete Applied Mathematics, vol. 40, pp. 363-378, 1992.
2. T.F. Gonzalez and S.L. Lee, "A 1.6 Approximation Algorithm for Routing Multiterminal Nets," SIAM J. Computing, vol. 16, pp. 669-704, 1987.
3. T.F. Gonzalez and S.L. Lee, "A Linear Time Algorithm for Optimal Routing Around a Rectangle," J. ACM, vol. 35, pp. 810-831, 1988.
4. A.S. LaPaugh, "A Polynomial Time Algorithm for Optimal Routing Around a Rectangle," Proc. 21st Symp. Foundations of Computer Science, pp. 282-293, 1980.
5. M. Sarrafzadeh and F.P. Preparata, "A Bottom-Up Layout Technique Based on Two-Rectangle Routing," Integration: The VLSI J., vol. 5, pp. 231-246, 1987.
6. B.S. Baker and R.Y. Pinter, "An Algorithm for the Optimal Placement and Routing of a Circuit within a Ring of Pads," Proc. 24th Symp. Foundations of Computer Science, pp. 360-370, 1983.
7. J.L. Ganley and J.P. Cohoon, "A Provably Good Moat Routing Algorithm," Proc. Sixth Great Lakes Symp. VLSI, pp. 86-91, 1996.
8. R.K. McGehee, "A Practical Moat Router," Proc. 24th Design Automation Conf., pp. 216-222, 1987.
9. D.C. Wang, "Pad Placement and Ring Routing for Custom Chip Layout," Proc. 27th Design Automation Conf., pp. 193-199, 1990.
10. F.T. Leighton, Introduction to Parallel Algorithms and Architectures. San Francisco: Morgan Kaufmann, 1992.
11. H. Okamura and P.D. Seymour, "Multicommodity Flows in Planar Graphs," J. Combinatorial Theory, Series B, vol. 31, pp. 75-81, 1981.
12. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W.H. Freeman, 1979.
13. J.L. Ganley, "Geometric Interconnection and Placement Algorithms," PhD thesis, Dept. of Computer Science, Univ. of Virginia, Charlottesville, Va., 1995.