
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Joseph L. Ganley, James P. Cohoon, "MinimumCongestion Hypergraph Embedding in a Cycle," IEEE Transactions on Computers, vol. 46, no. 5, pp. 600602, May, 1997.  
BibTex  x  
@article{ 10.1109/12.589233, author = {Joseph L. Ganley and James P. Cohoon}, title = {MinimumCongestion Hypergraph Embedding in a Cycle}, journal ={IEEE Transactions on Computers}, volume = {46}, number = {5}, issn = {00189340}, year = {1997}, pages = {600602}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.589233}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  MinimumCongestion Hypergraph Embedding in a Cycle IS  5 SN  00189340 SP600 EP602 EPD  600602 A1  Joseph L. Ganley, A1  James P. Cohoon, PY  1997 KW  Hypergraph embedding in a cycle KW  congestion KW  NPcompleteness KW  approximation algorithms KW  routing around a rectangle KW  moat routing KW  ring routing. VL  46 JA  IEEE Transactions on Computers ER   
Abstract—The
[1] A. Frank, T. Nishizeki, N. Saito, H. Suzuki, and É. Tardos, “Algorithms for Routing around a Rectangle,” Discrete Applied Math., vol. 40, pp. 363378, 1992.
[2] T.F. Gonzalez and S.L. Lee, "A 1.6 Approximation Algorithm for Routing Multiterminal Nets," SIAM J. Computing, vol. 16, pp. 669704, 1987.
[3] T.F. Gonzalez and S.L. Lee, "A Linear Time Algorithm for Optimal Routing Around a Rectangle," J. ACM, vol. 35, pp. 810831, 1988.
[4] A.S. LaPaugh, "A Polynomial Time Algorithm for Optimal Routing Around a Rectangle," Proc. 21st Symp. Foundations of Computer Science, pp. 282293, 1980.
[5] M. Sarrafzadeh and F.P. Preparata, "A BottomUp Layout Technique Based on TwoRectangle Routing," Integration: The VLSI Journal, vol. 5, pp. 231246, 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. 360370, 1983.
[7] J.L. Ganley and J.P. Cohoon, "A Provably Good Moat Routing Algorithm," Proc. Sixth Great Lakes Symp. VLSI, pp. 8691, 1996.
[8] R.K. McGehee, "A Practical Moat Router," Proc. 24th Design Automation Conf., pp. 216222, 1987.
[9] D.C. Wang, "Pad Placement and Ring Routing for Custom Chip Layout," Proc. 27th Design Automation Conf., pp. 193199, 1990.
[10] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[11] H. Okamura and P.D. Seymour, "Multicommodity Flows in Planar Graphs," J. Combinatorial Theory, Series B, vol. 31, pp. 7581, 1981.
[12] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness.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.