Approximating transitive reductions for directed networks

Piotr Berman, Bhaskar Dasgupta, Marek Karpinski

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

    10 Scopus citations


    We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological and social network applications. We provide -approximation algorithms for all the minimization problems and 2-approximation algorithms for all the maximization problems using appropriate primal-dual polytopes. We also show lower bounds on the integrality gap of the polytope to provide some intuition on the final limit of such approaches. Furthermore, we provide APX-hardness result for all those problems even if the length of all simple cycles is bounded by 5.

    Original languageEnglish (US)
    Title of host publicationAlgorithms and Data Structures - 11th International Symposium, WADS 2009, Proceedings
    Number of pages12
    StatePublished - 2009
    Event11th International Symposium on Algorithms and Data Structures, WADS 2009 - Banff, AB, Canada
    Duration: Aug 21 2009Aug 23 2009

    Publication series

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


    Other11th International Symposium on Algorithms and Data Structures, WADS 2009
    CityBanff, AB

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • General Computer Science


    Dive into the research topics of 'Approximating transitive reductions for directed networks'. Together they form a unique fingerprint.

    Cite this