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

Authors:
Chaoxia Yang;Guojun Li
Affiliations:
School of Mathematics, Shandong University, Jinan, China and Department of Biochemistry and Molecular Biology, University of Georgia, GA;School of Mathematics, Shandong University, Jinan, China and Department of Biochemistry and Molecular Biology, University of Georgia, GA
Venue:
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Year:
2010

Citing 6
Cited 1

Algorithms for routing around a rectangle

Discrete Applied Mathematics - Special issue: graphs in electrical engineering, discrete algorithms and complexity
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
Efficient Algorithms for Minimum Congestion Hypergraph Embedding in a Cycle

IEEE Transactions on Parallel and Distributed Systems
A polynomial-time approximation scheme for embedding hypergraph in a cycle

ACM Transactions on Algorithms (TALG)

A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

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, 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.