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.
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
Ganley JL, Cohoon JP (1997) Minimum-congestion hypergraph embedding in a cycle. IEEE Trans Comput 46:600–602
Gonzalez T (1998) Improved approximation algorithm for embedding hyperedges in a cycle. Inf Process Lett 67:267–271
Ho H, Lee S (2007) Improved approximation algorithms for weighted hypergraph embedding in a cycle. SIAM J Optim 18:1490–1500
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
Lee SL, Ho H-J (2003) On minimizing the maximum congestion for weighted hypergraph embedding in a cycle. Inf Process Lett 87:271–275
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
Li M, Ma B, Wang L (2002) On the closest string and substring problems. J ACM 49:157–171
Motwani R, Raghavan P (1995) Randomized algorithms. Cambridge Univ Press, Cambridge
Nong QQ, Yuan JJ, Lin YX (2009) The weighted link ring loading problem. J Comb Optim 18:38–50
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
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
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
Author information
Authors and Affiliations
Corresponding author
Rights 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
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-011-9387-1