
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
QianPing Gu, Yong Wang, "Efficient Algorithms for Minimum Congestion Hypergraph Embedding in a Cycle," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 3, pp. 205214, March, 2006.  
BibTex  x  
@article{ 10.1109/TPDS.2006.34, author = {QianPing Gu and Yong Wang}, title = {Efficient Algorithms for Minimum Congestion Hypergraph Embedding in a Cycle}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {17}, number = {3}, issn = {10459219}, year = {2006}, pages = {205214}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2006.34}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Efficient Algorithms for Minimum Congestion Hypergraph Embedding in a Cycle IS  3 SN  10459219 SP205 EP214 EPD  205214 A1  QianPing Gu, A1  Yong Wang, PY  2006 KW  Hypergraph embedding KW  approximation algorithms KW  communication on rings KW  edge congestion minimization. VL  17 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—The
[1] Q.P. Gu and Y. Wang, “Efficient Algorithm for Embedding Hypergraphs in a Cycle,” Proc. 10th Int'l Conf. High Performance Computing (HiPC '03), pp. 8594, 2003.
[2] J.L. Ganley and J.P. Cohoon, “MinimumCongestion Hypergraph Embedding on a Cycle,” IEEE Trans. Computers, vol. 46, no. 5, pp. 600602, 1997.
[3] A. Frank, T. Nishizeki, N. Saito, H. Suzuki, and E. Tardos, “Algorithms for Routing around a Rectangle,” Discrete Applied Math., vol. 40, no. 3, pp. 363378, 1992.
[4] T. Gonzalez and S.L. Lee, “A 1. 6 Approximation Algorithm for Routing Multiterminal Nets,” SIAM J. Computing, vol. 16, no. 4, pp. 669704, 1987.
[5] T. Gonzalez and S.L. Lee, “A Linear Time Algorithm for Optimal Routing around a Rectangle,” J. ACM, vol. 35, no. 4, pp. 810832, 1988.
[6] A.S. LaPaugh, “A Polynomial Time Algorithm for Optimal Routing around a Rectangle,” Proc. 21st Symp. Foundations of Computer Science (FOCS '80), pp. 282293, 1980.
[7] M. Sarrafzadeh and F.P. Preparata, “A BottomUp Layout Technique Based on TwoRectangle Routing,” Integration, the VLSI J., vol. 5, no. 4, pp. 231246, 1987.
[8] H. Okamura and P.D. Seymour, “Multicommodity Flows in Planar Graphs,” J. Combinatorial Theory, Series B, vol. 31, pp. 7581, 1981.
[9] T. Carpenter, S. Cosares, J.L. Ganley, and I. Saniee, “A Simple Approximation Algorithm for Two Problems in Circuit Design,” IEEE Trans. Computers, vol. 47, no. 11, pp. 13101312, 1990.
[10] T. Gonzalez, “Improved Approximation Algorithms for Embedding Hyperedges in a Cycle,” Information Processing Letters, vol. 67, no. 5, pp. 267271, 1998.
[11] S.L. Lee and H.J. Ho, “On Minimizing the Maximum Congestion for Weighted Hypergraph Embedding in a Cycle,” Information Processing Letters, vol. 87, no. 5, pp. 271275, 2003.
[12] X.T. Deng and G.J. Li, “A PTAS for Embedding Hypergraph in a Cycle,” Proc. 31st Int'l Colloquium Automata, Language, and Programming (ICALP '04), pp. 433444, 2004.