Abstract
The problem of Minimum Congestion Hypergraph Embedding in a Cycle (MCHEC) is to embed the hyperedges of a hypergraph as paths in a cycle such that the maximum congestion (the maximum number of paths that use any single link in the cycle) is minimized. This problem has many applications, including minimizing communication congestions in computer networks and parallel computations. The MCHEC problem is NP-hard. We give a 1.8-approximation algorithm for the problem. This improves the previous 2-approximation results. The algorithm has the optimal O(mn) time for the hypergraph with m hyperedges and n nodes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Carpenter, T., Cosares, S., Ganley, J.L., Saniee, I.: A simple approximation algorithm for two problems in circuit design. IEEE Trans. on Computers 47(11), 1310–1312 (1998)
Frank, A., Nishizeki, T., Saito, N., Suzuki, H., Tardos, E.: Algorithms for routing around a rectangle. Discrete Applied Mathematics 40, 363–378 (1992)
Ganley, J.L., Cohoon, J.P.: Minimum-congestion hypergraph embedding on a cycle. IEEE Trans. on Computers 46(5), 600–602 (1997)
Gonzalez, T.: Improved approximation algorithms for embedding hyperedges in a cycle. Information Processing Letters 67, 267–271 (1998)
Gonzalez, T., Lee, S.L.: A 1.6 approximation algorithm for routing multiterminal nets. SIAM J. on Computing 16, 669–704 (1987)
Gonzalez, T., Lee, S.L.: A linear time algorithm for optimal routing around a rectangle. Journal of ACM 35(4), 810–832 (1988)
LaPaugh, A.S.: A polynomial time algorithm for optimal routing around a rectangle. In: Proc. of the 21st Symposium on Foundations of Computer Science (FOCS 1980), pp. 282–293 (1980)
Lee, S.L., Ho, H.J.: Algorithms and complexity for weighted hypergraph embedding in a cycle. In: Proc. of the 1st International Symposium on Cyber World (CW 2002), pp. 70–75 (2002)
Sarrafzadeh, M., Preparata, F.P.: A bottom-up layout technique based on tworectangle routing. Integration: The VLSI Journal 5, 231–246 (1987)
Okamura, H., Seymour, P.D.: Multicommodity flows in planar graphs. Journal of Combinatorial Theory, Series B 31, 75–81 (1981)
Gu, Q.P., Wang, Y.: Efficient algorithm for embedding hypergraphs in a cycle. Technical Report 2003-03, School of Computing Science, Simon Fraser University (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gu, QP., Wang, Y. (2003). Efficient Algorithm for Embedding Hypergraphs in a Cycle. In: Pinkston, T.M., Prasanna, V.K. (eds) High Performance Computing - HiPC 2003. HiPC 2003. Lecture Notes in Computer Science, vol 2913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24596-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-24596-4_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20626-2
Online ISBN: 978-3-540-24596-4
eBook Packages: Springer Book Archive