Advertisement

A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Weighted Cycle

  • Chaoxia Yang
  • Guojun Li
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6213)

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.

Keywords

hypergraph embedding weighted cycle minimum congestion NP-hard polynomial time approximation scheme 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Andras, F.: Edge-disjoint paths in planar graphs. J. Combin. Theory Ser. B 38, 164–178 (1985)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Andras, F., Takao, N., Nobuji, S., Hitoshi, S., Eva, T.: Algorithms for routing around a rectangle. Discrete Applied Mathematics 40, 363–378 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Joseph, L.G., James, P.C.: Minimum-congestion hypergraph embedding in a cycle. IEEE Trans. Comput. 46(5), 600–602 (1997)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Qianping, G., Yong, W.: Efficient algorithm for embedding hypergraph in a cycle. IEEE Transactions on Parallel and Distributed Systems 17(3), 205–214 (2006)CrossRefGoogle Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    Guojun, L., Xiaotie, D., Ying, X.: A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Cycle. IEEE/ACM Transactions on Algorithms (to appear)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Chaoxia Yang
    • 1
    • 2
  • Guojun Li
    • 1
    • 2
  1. 1.School of MathematicsShandong UniversityJinanChina
  2. 2.Department of Biochemistry and Molecular BiologyUniversity of GeorgiaUSA

Personalised recommendations