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

Authors:
Kang Li;Lusheng Wang
Affiliations:
School of Information Science and Engineering, Shandong University, Jinan, Shandong Province, P.R. China;Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong
Venue:
Information Processing Letters
Year:
2006

Citing 6
Cited 0

Algorithms for routing around a rectangle

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

Randomized 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)

Quantified Score

Hi-index	0.89

Visualization

Abstract

We study the problem of embedding a directed hypergraph on a ring that has applications in optical network communications. The undirected version (MCHEC) has been extensively studied. It was shown that the undirect version was NP-complete. A polynomial time approximation scheme (PTAS) for the undirected version has been developed. In this paper, we design a polynomial time approximation scheme for the directed version.