The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—The <it>Minimum Congestion Hypergraph Embedding in a Cycle (MCHEC)</it> problem is to embed the hyperedges of a hypergraph as paths in a cycle with the same node set such that the <it>maximum congestion</it> (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 <tmath>O(mn)</tmath> for a hypergraph with <tmath>m</tmath> hyperedges and <tmath>n</tmath> nodes. We also propose an algorithm which finds an embedding with the optimal congestion <tmath>L^*</tmath> for the MCHEC problem in <tmath>O(n(nL^{*})^{L^{*}})</tmath> time. This improves the previous <tmath>O((mn)^{L^{*}+1})</tmath> time algorithm.</p>
Hypergraph embedding, approximation algorithms, communication on rings, edge congestion minimization.

Y. Wang and Q. Gu, "Efficient Algorithms for Minimum Congestion Hypergraph Embedding in a Cycle," in IEEE Transactions on Parallel & Distributed Systems, vol. 17, no. , pp. 205-214, 2006.
88 ms
(Ver 3.3 (11022016))