Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem

@inproceedings{Adamaszek2014ApproximationAH,
  title={Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem},
  author={Anna Adamaszek and Guillaume Blin and Alexandru Popa},
  booktitle={IWOCA},
  year={2014}
}
In this paper we study the following problem, named Maximum Edges in Transitive Closure, which has applications in computational biology. Given a simple, undirected graph G = (V,E) and a coloring of the vertices, remove a collection of edges from the graph such that each connected component is colorful (i.e., it does not contain two identically colored vertices) and the number of edges in the transitive closure of the graph is maximized. The problem is known to be APX-hard, and no approximation… CONTINUE READING

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…