Efficient Algorithm for Embedding Hypergraphs in a Cycle
- 319 Downloads
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.
KeywordsHypergraph embedding in a cycle approximation algorithms communication on rings link congestion minimization
Unable to display preview. Download preview PDF.
- 7.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)Google Scholar
- 8.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)Google Scholar
- 11.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)Google Scholar