For a given directed hypergraph H = (V , EH ) and a weighted ring R = (V , ER,w), the problem here is to find an embedding for the hyperedges in H such that the ...
We study the problem of embedding a directed hypergraph on a ring that has applications in optical network communications. The undirected version (MCHEC) ...
Jan 25, 2011 · Given a directed hypergraph H=(V,E H ), we consider the problem of embedding all directed hyperedges on a weighted ring.
[PDF] A polynomial time approximation scheme for embedding a directed ...
www.cs.cityu.edu.hk › ipl05
Abstract. We study the problem of embedding a directed hypergraph on a ring that has applications in optical network communications.
A polynomial-time approximation scheme is presented, settling the debate regarding whether the problem of embedding hyperedges of a hypergraph as paths in a ...
Downloadable (with restrictions)! Given a directed hypergraph H=(V,E H ), we consider the problem of embedding all directed hyperedges on a weighted ring.
A polynomial time approximation scheme for the problem of embedding all directed hyperedges on a weighted ring to minimize the maximum congestion.
Oct 22, 2024 · A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring. Article. Full-text available. Oct 2012.
A polynomial time approximation scheme (PTAS) for the undirected version has been developed. In this paper, we design a polynomial time approximation scheme for ...
Finally, we present a polynomial time approxi- mation scheme (PTAS) for the special version where each directed hyperedge only contains one sink. Keywords Mixed ...