This Article 
 Bibliographic References 
 Add to: 
Efficient Algorithms for Minimum Congestion Hypergraph Embedding in a Cycle
March 2006 (vol. 17 no. 3)
pp. 205-214
Yong Wang, IEEE

Abstract—The Minimum Congestion Hypergraph Embedding in a Cycle (MCHEC) problem is to embed the hyperedges of a hypergraph as paths in a cycle with the same node set such that the maximum congestion (the maximum number of paths that use any single edge in the cycle) is minimized. The MCHEC problem has many applications, including optimizing communication congestions in computer networks and parallel computing. The problem is NP-hard. In this paper, we give a 1.8-approximation algorithm for the MCHEC problem. This improves the previous 2-approximation results. Our algorithm has the optimal time complexity O(mn) for a hypergraph with m hyperedges and n nodes. We also propose an algorithm which finds an embedding with the optimal congestion L^* for the MCHEC problem in O(n(nL^{*})^{L^{*}}) time. This improves the previous O((mn)^{L^{*}+1}) time algorithm.

[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. 85-94, 2003.
[2] J.L. Ganley and J.P. Cohoon, “Minimum-Congestion Hypergraph Embedding on a Cycle,” IEEE Trans. Computers, vol. 46, no. 5, pp. 600-602, 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. 363-378, 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. 669-704, 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. 810-832, 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. 282-293, 1980.
[7] M. Sarrafzadeh and F.P. Preparata, “A Bottom-Up Layout Technique Based on Two-Rectangle Routing,” Integration, the VLSI J., vol. 5, no. 4, pp. 231-246, 1987.
[8] H. Okamura and P.D. Seymour, “Multicommodity Flows in Planar Graphs,” J. Combinatorial Theory, Series B, vol. 31, pp. 75-81, 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. 1310-1312, 1990.
[10] T. Gonzalez, “Improved Approximation Algorithms for Embedding Hyperedges in a Cycle,” Information Processing Letters, vol. 67, no. 5, pp. 267-271, 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. 271-275, 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. 433-444, 2004.

Index Terms:
Hypergraph embedding, approximation algorithms, communication on rings, edge congestion minimization.
Qian-Ping 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. 205-214, March 2006, doi:10.1109/TPDS.2006.34
Usage of this product signifies your acceptance of the Terms of Use.