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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andras, F.: Edge-disjoint paths in planar graphs. J. Combin. Theory Ser. B 38, 164–178 (1985)
Andras, F., Takao, N., Nobuji, S., Hitoshi, S., Eva, T.: Algorithms for routing around a rectangle. Discrete Applied Mathematics 40, 363–378 (1992)
Joseph, L.G., James, P.C.: Minimum-congestion hypergraph embedding in a cycle. IEEE Trans. Comput. 46(5), 600–602 (1997)
Qianping, G., Yong, W.: Efficient algorithm for embedding hypergraph in a cycle. IEEE Transactions on Parallel and Distributed Systems 17(3), 205–214 (2006)
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)
Singling, L., Hannjang, H.: A 1.5 approximation algorithm for embedding hyperedges in a cycle. IEEE Transactions on Parallel and Distributed Systems 16(6), 481–488 (2005)
Guojun, L., Xiaotie, D., Ying, X.: A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Cycle. IEEE/ACM Transactions on Algorithms (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, C., Li, G. (2010). A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Weighted Cycle. In: Lee, DT., Chen, D.Z., Ying, S. (eds) Frontiers in Algorithmics. FAW 2010. Lecture Notes in Computer Science, vol 6213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14553-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-14553-7_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14552-0
Online ISBN: 978-3-642-14553-7
eBook Packages: Computer ScienceComputer Science (R0)