Skip to main content
SpringerLink
Log in

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

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Given a directed hypergraph H=(V,E H ), we consider the problem of embedding all directed hyperedges on a weighted ring. The objective is to minimize the maximum congestion which is equal to the maximum product of the weight of a link and the number of times that the link is passed by the embedding. In this paper, we design a polynomial time approximation scheme for this problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Deng X, Li G (2004) A PTAS for embedding hypergraph in a cycle (extended abstract). In: Proc 31st internat colloquium on automata, languages and programming (ICALP 2004), Turku, Finland, 2004, pp 433–444

    Chapter  Google Scholar 

  • Ganley JL, Cohoon JP (1997) Minimum-congestion hypergraph embedding in a cycle. IEEE Trans Comput 46:600–602

    Article  MathSciNet  Google Scholar 

  • Gonzalez T (1998) Improved approximation algorithm for embedding hyperedges in a cycle. Inf Process Lett 67:267–271

    Article  Google Scholar 

  • Ho H, Lee S (2007) Improved approximation algorithms for weighted hypergraph embedding in a cycle. SIAM J Optim 18:1490–1500

    Article  MathSciNet  MATH  Google Scholar 

  • Hochbaum DS, Shmoys D (1988) A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM J Comput 17:539–551

    Article  MathSciNet  MATH  Google Scholar 

  • Lee SL, Ho H-J (2003) On minimizing the maximum congestion for weighted hypergraph embedding in a cycle. Inf Process Lett 87:271–275

    Article  MathSciNet  MATH  Google Scholar 

  • Li G, Deng X, Xu Y (2009) A polynomial time approximation scheme for embedding hypergraph in a cycle. ACM Trans Algorithms 5, Article No 20

  • Li K, Wang L (2006) A polynomial time approximation scheme for embedding a directed hypergraph on a ring. Inf Process Lett 97:203–207

    Article  MATH  Google Scholar 

  • Li M, Ma B, Wang L (2002) On the closest string and substring problems. J ACM 49:157–171

    Article  MathSciNet  Google Scholar 

  • Motwani R, Raghavan P (1995) Randomized algorithms. Cambridge Univ Press, Cambridge

    MATH  Google Scholar 

  • Nong QQ, Yuan JJ, Lin YX (2009) The weighted link ring loading problem. J Comb Optim 18:38–50

    Article  MathSciNet  MATH  Google Scholar 

  • Nong QQ, Cheng TCE, Ng CT (2010) A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting. Theor Comput Sci 411:2978–2986

    Article  MathSciNet  MATH  Google Scholar 

  • Yang C, Li G (2010) A polynomial time approximation scheme for embedding hypergraph in a weighted cycle. In: Lecture notes in computer science, vol 6213, pp 197–209

    Google Scholar 

  • Yang Z (2008) A 2-approximation algorithm for an embedded hypergraph in a weighted cycle. J Shandong Univ (Nat Sci) 43:11–13, in Chinese

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Yunnan University, Kunming, 650091, P.R. China

    Jianping Li

  2. Department of Atmospheric Science, Yunnan University, Kunming, 650091, P.R. China

    Weidong Li

  3. Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong, P.R. China

    Lusheng Wang

Authors
  1. Jianping Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Weidong Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lusheng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lusheng Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, J., Li, W. & Wang, L. A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring. J Comb Optim 24, 319–328 (2012). https://doi.org/10.1007/s10878-011-9387-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-011-9387-1

Keywords

Search

Navigation