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

Authors:
Jianping Li;Weidong Li;Lusheng Wang
Affiliations:
Department of Mathematics, Yunnan University, Kunming, P.R. China 650091;Department of Atmospheric Science, Yunnan University, Kunming, P.R. China 650091;Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong, P.R. China
Venue:
Journal of Combinatorial Optimization
Year:
2012

Citing 11
Cited 0

A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach

SIAM Journal on Computing
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
On minimizing the maximum congestion for Weighted Hypergraph Embedding in a Cycle

Information Processing Letters
Improved Approximation Algorithms for Weighted Hypergraph Embedding in a Cycle

SIAM Journal on Optimization
A polynomial-time approximation scheme for embedding hypergraph in a cycle

ACM Transactions on Algorithms (TALG)
A polynomial time approximation scheme for embedding a directed hypergraph on a ring

Information Processing Letters
A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting

Theoretical Computer Science
A polynomial time approximation scheme for embedding hypergraph in a weighted cycle

FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics

Quantified Score

Hi-index	0.00

Visualization

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.