Approximation and hardness results for the maximum edges in transitive closure problem

Anna Adamaszek, Guillaume Blin, Alexandru Popa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)


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 algorithms are known for it. We improve the hardness result by showing that the problem is NP-hard to approximate within a factor of |V |1/3−ε, for any constant ε > 0. Additionally, we show that the problem is APXhard already for the case when the number of vertex colors equals 3. We complement these results by showing the first approximation algorithm for the problem, with approximation factor [formula presented].

Original languageEnglish
Title of host publicationCombinatorial Algorithms - 25th International Workshop, IWOCA 2014, Revised Selected Papers
EditorsDalibor Froncek, Jan Kratochvíl, Mirka Miller
PublisherSpringer Verlag
Number of pages11
ISBN (Electronic)9783319193144
Publication statusPublished - 2015
Event25th International Workshop on Combinatorial Algorithms, IWOCA 2014 - Duluth, United States
Duration: Oct 15 2014Oct 17 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other25th International Workshop on Combinatorial Algorithms, IWOCA 2014
CountryUnited States

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Approximation and hardness results for the maximum edges in transitive closure problem'. Together they form a unique fingerprint.

Cite this