A PTAS for Embedding Hypergraph in a Cycle (Extended Abstract)
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Embedding a Weighted Directed Hypergraph on a Mixed Cycle∗
Given a weighted directed hypergraph H = (V,EH ;w), where w : EH → R+, we consider the problem of embedding all weighted directed hyperedges on a mixed cycle, which consists of undirected and directed links. The objective is to minimize the maximum congestion of any undirected or directed link in the mixed cycle. In this paper, we first formulate this new problem as an integer linear program, a...
متن کاملA polynomial time approximation scheme for embedding a directed hypergraph on a ring
We study the problem of embedding a directed hypergraph on a ring that has applications in optical network communications. The undirected version (MCHEC) has been extensively studied. It was shown that the undirect version was NP-complete. A polynomial time approximation scheme (PTAS) for the undirected version has been developed. In this paper, we design a polynomial time approximation scheme ...
متن کاملA PTAS for vertex guarding weakly-visible polygons - An extended abstract
In this extended abstract, we first present a PTAS for guarding the vertices of a weakly-visible polygon P from a subset of its vertices, or in other words, a PTAS for computing a minimum dominating set of the visibility graph of the vertices of P . We then show how to obtain a PTAS for vertex guarding the entire polygon. Digital Object Identifier 10.4230/LIPIcs...
متن کاملOn minimizing the maximum congestion for Weighted Hypergraph Embedding in a Cycle
The problem of Weighted Hypergraph Embedding in a Cycle (WHEC) is to embed the weighted hyperedges of a hypergraph as the paths in a cycle, such that the maximum congestion of any physical link in the cycle is minimized. A simpler version of this problem is the Weighted Graph Embedding in a Cycle (WGEC) that embeds the weighted edges of a normal graph as the paths in a cycle. The WHEC and WGEC ...
متن کاملEfficient Algorithm for Embedding Hypergraphs in a Cycle
The problem of Minimum Congestion Hypergraph Embedding in a Cycle (MCHEC) is to embed the hyperedges of a hypergraph as paths in a cycle such that the maximum congestion (the maximum number of paths that use any single link in the cycle) is minimized. This problem has many applications, including minimizing communication congestions in computer networks and parallel computations. The MCHEC prob...
متن کامل