A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring
2011
Journal of combinatorial optimization
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. Keywords Directed hypergraph · Embedding · PTAS Introduction For a minimization problem and a polynomial
doi:10.1007/s10878-011-9387-1
fatcat:h6t6o7hgmfgfthmhaw4zd6euje