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, i.e. the maximum product of the weight of an edge and the number of times that the edge is passed by the embedding, is minimized. It is known that the problem, the same as the unweighted case, is NP-hard. The aim of this paper is to present a polynomial time approximation scheme (PTAS) for the problem.
Keywordshypergraph embedding weighted cycle minimum congestion NP-hard polynomial time approximation scheme
Unable to display preview. Download preview PDF.
- 5.Singling, L., Hannjang, H.: Algorithms and complexity for weighted hypergraph embedding in a cycle. In: Proc. of the 1st International Symposium on Cyber World (2002)Google Scholar
- 7.Guojun, L., Xiaotie, D., Ying, X.: A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Cycle. IEEE/ACM Transactions on Algorithms (to appear)Google Scholar