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

Authors:
Guojun Li;Xiaotie Deng;Ying Xu
Affiliations:
Shandong University, Jinan, China/ University of Georgia, GA;City University of Hong Kong, Hong Kong, China;University of Georgia, GA
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2009

Citing 8
Cited 3

Algorithms for routing around a rectangle

Discrete Applied Mathematics - Special issue: graphs in electrical engineering, discrete algorithms and complexity
Randomized algorithms

Randomized algorithms
Algorithmic Chernoff-Hoeffding inequalities in integer programming

Random Structures & Algorithms
Improved approximation algorithms for embedding hyperedges in a cycle

Information Processing Letters
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

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

FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
A polynomial time approximation scheme for embedding hypergraph in a weighted cycle

Theoretical Computer Science
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

We consider the problem of embedding hyperedges of a hypergraph as paths in a cycle such that the maximum congestion, namely the maximum number of paths that use any single edge in a cycle, is minimized. The minimum congestion hypergraph embedding in a cycle problem is known to be NP-hard and its graph version, the minimum congestion graph embedding in a cycle, is solvable in polynomial-time. Furthermore, for the graph problem, a polynomial-time approximation scheme for the weighted version is known. For the hypergraph model, several approximation algorithms with a ratio of two have been previously published. A recent paper reduced the approximation ratio to 1.5. We present a polynomial-time approximation scheme in this article, settling the debate regarding whether the problem is polynomial-time approximable.