Efficient algorithms for minimum congestion hypergraph embedding in a cycle

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*)/sup L*/) time. This improves the previous O((mn)/sup L*+1/) time algorithm.

[1]  Refael Hassin,et al.  On multicommodity flows in planar graphs , 1984, Networks.

[2]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[3]  Majid Sarrafzadeh,et al.  A bottom-up layout technique based on two-rectangle routing , 1987, Integr..

[4]  Joseph L. Ganley,et al.  A Simple Approximation Algorithm for Two Problems in Circuit Design , 1998, IEEE Trans. Computers.

[5]  J. Cadorette,et al.  A 1 ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? , 2004 .

[6]  Andrea S. LaPaugh,et al.  A polynomial time algorithm for optimal routing around a rectangle , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[7]  Teofilo F. Gonzalez,et al.  Improved Approximation Algorithms for Embedding Hyperedges in a Cycle , 1998, Inf. Process. Lett..

[8]  Yong Wang,et al.  Efficient Algorithm for Embedding Hypergraphs in a Cycle , 2003, HiPC.

[9]  Teofilo F. Gonzalez,et al.  A linear time algorithm for optimal routing around a rectangle , 1988, JACM.

[10]  Joseph L. Ganley,et al.  Minimum-Congestion Hypergraph Embedding in a Cycle , 1997, IEEE Trans. Computers.

[11]  Xiaotie Deng,et al.  A PTAS for Embedding Hypergraph in a Cycle (Extended Abstract) , 2004, ICALP.

[12]  Hann-Jang Ho,et al.  On minimizing the maximum congestion for Weighted Hypergraph Embedding in a Cycle , 2003, Inf. Process. Lett..

[13]  Nobuji Saito,et al.  Algorithms for Routing around a Rectangle , 1992, Discret. Appl. Math..

[14]  Teofilo F. Gonzalez,et al.  A 1.6 Approximation Algorithm for Routing Multiterminal Nets , 1987, SIAM J. Comput..