Efficient Algorithm for Embedding Hypergraphs in a Cycle

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.

Original document

The different versions of the original document can be found in:

• http://www.cs.sfu.ca/research/groups/NML/publication/gu-wang.pdf

• http://link.springer.com/content/pdf/10.1007/978-3-540-24596-4_10,

http://dx.doi.org/10.1007/978-3-540-24596-4_10

• https://www.cs.sfu.ca/research/groups/NML/publication/gu-wang.pdf,

https://dblp.uni-trier.de/db/conf/hipc/hipc2003.html#GuW03,

https://link.springer.com/chapter/10.1007%2F978-3-540-24596-4_10,

https://core.ac.uk/display/24625584,

https://www.scipedia.com/public/Gu_Wang_2010a,

https://rd.springer.com/chapter/10.1007/978-3-540-24596-4_10,

https://academic.microsoft.com/#/detail/1545073706