A polynomial time approximation scheme for embedding hypergraph in a weighted cycle

The problem of Minimum Congestion Hypergraph Embedding in a Weighted Cycle (MCHEWC) is to embed the hyperedges of a hypergraph as paths in a weighted cycle such that the maximum congestion is minimized. This problem is NP-hard. In this paper, we present a polynomial time approximation scheme (PTAS) for this problem.