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

Authors:
Chaoxia Yang;Guojun Li
Affiliations:
School of Mathematics, Shandong University, Jinan 250100, PR China;School of Mathematics, Shandong University, Jinan 250100, PR China and Department of Biochemistry and Molecular Biology, University of Georgia, GA 30602, USA
Venue:
Theoretical Computer Science
Year:
2011

Citing 7
Cited 0

Algorithms for routing around a rectangle

Discrete Applied Mathematics - Special issue: graphs in electrical engineering, discrete algorithms and complexity
On the closest string and substring problems

Journal of the ACM (JACM)
Minimum-Congestion Hypergraph Embedding in a Cycle

IEEE Transactions on Computers
Algorithms and Complexity for Weighted Hypergraph Embedding in a Cycle

CW '02 Proceedings of the First International Symposium on Cyber Worlds (CW'02)
A 1.5 Approximation Algorithm for Embedding Hyperedges in a Cycle

IEEE Transactions on Parallel and Distributed Systems
Improved Approximation Algorithms for Weighted Hypergraph Embedding in a Cycle

SIAM Journal on Optimization
A polynomial-time approximation scheme for embedding hypergraph in a cycle

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	5.23

Visualization

Abstract

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.