# 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} }

- Published 2014 in IWOCA
DOI:10.1007/978-3-319-19315-1_2

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

#### From This Paper

##### Figures, tables, and topics from this paper.

#### Citations

##### Publications citing this paper.

## Parameterized Complexity and Approximation Issues for the Colorful Components Problems

View 4 Excerpts

Highly Influenced

#### References

##### Publications referenced by this paper.

Showing 1-10 of 11 references

## OMG! Orthologs in Multiple Genomes - Competing Graph-Theoretical Formulations

View 10 Excerpts

Highly Influenced

## A graph-theoretic approach for inparalog detection

View 2 Excerpts

## Some Results on more Flexible Versions of Graph Motif

View 2 Excerpts

## The multi-multiway cut problem

View 1 Excerpt