Approximating transitive reductions for directed networks

Piotr Berman, Bhaskar Dasgupta, Marek Karpinski

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

    7 Citations (Scopus)

    Abstract

    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
    Pages74-85
    Number of pages12
    DOIs
    StatePublished - Sep 14 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

    Other

    Other11th International Symposium on Algorithms and Data Structures, WADS 2009
    CountryCanada
    CityBanff, AB
    Period8/21/098/23/09

    Fingerprint

    Directed Network
    Approximation algorithms
    Approximation Algorithms
    Integrality
    Primal-dual
    Biological Networks
    Polytopes
    Hardness
    Polytope
    Digraph
    Minimization Problem
    Social Networks
    Lower bound
    Cycle
    Optimization

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Berman, P., Dasgupta, B., & Karpinski, M. (2009). Approximating transitive reductions for directed networks. In Algorithms and Data Structures - 11th International Symposium, WADS 2009, Proceedings (pp. 74-85). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5664 LNCS). https://doi.org/10.1007/978-3-642-03367-4_7
    Berman, Piotr ; Dasgupta, Bhaskar ; Karpinski, Marek. / Approximating transitive reductions for directed networks. Algorithms and Data Structures - 11th International Symposium, WADS 2009, Proceedings. 2009. pp. 74-85 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{bb2b05d6fde84f128414e5264b14647a,
    title = "Approximating transitive reductions for directed networks",
    abstract = "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.",
    author = "Piotr Berman and Bhaskar Dasgupta and Marek Karpinski",
    year = "2009",
    month = "9",
    day = "14",
    doi = "10.1007/978-3-642-03367-4_7",
    language = "English (US)",
    isbn = "3642033660",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    pages = "74--85",
    booktitle = "Algorithms and Data Structures - 11th International Symposium, WADS 2009, Proceedings",

    }

    Berman, P, Dasgupta, B & Karpinski, M 2009, Approximating transitive reductions for directed networks. in Algorithms and Data Structures - 11th International Symposium, WADS 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5664 LNCS, pp. 74-85, 11th International Symposium on Algorithms and Data Structures, WADS 2009, Banff, AB, Canada, 8/21/09. https://doi.org/10.1007/978-3-642-03367-4_7

    Approximating transitive reductions for directed networks. / Berman, Piotr; Dasgupta, Bhaskar; Karpinski, Marek.

    Algorithms and Data Structures - 11th International Symposium, WADS 2009, Proceedings. 2009. p. 74-85 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5664 LNCS).

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

    TY - GEN

    T1 - Approximating transitive reductions for directed networks

    AU - Berman, Piotr

    AU - Dasgupta, Bhaskar

    AU - Karpinski, Marek

    PY - 2009/9/14

    Y1 - 2009/9/14

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=69949150660&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=69949150660&partnerID=8YFLogxK

    U2 - 10.1007/978-3-642-03367-4_7

    DO - 10.1007/978-3-642-03367-4_7

    M3 - Conference contribution

    AN - SCOPUS:69949150660

    SN - 3642033660

    SN - 9783642033667

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 74

    EP - 85

    BT - Algorithms and Data Structures - 11th International Symposium, WADS 2009, Proceedings

    ER -

    Berman P, Dasgupta B, Karpinski M. Approximating transitive reductions for directed networks. In Algorithms and Data Structures - 11th International Symposium, WADS 2009, Proceedings. 2009. p. 74-85. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-03367-4_7